题解#牛可乐争霸赛

很乐的B题，读完题意之后发现可以把宝箱和人放一起，然后用墙堵上就行了

#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
#define rep(i, j, k) for(int i = int(j); i <= int(k); i++)
#define per(i, j, k) for(int i = int(j); i >= int(k); i--)


void solve() {
	int n, m;
    cin >> n >> m;
    string s;
    cin >> s;
    while(m--) {
        int x, y, z;
        cin >> x >> y >> z;
    }
    cout << "10";
    rep(i, 1, n - 2) cout << "2";
    cout << '\n';
    cout << "0";
    rep(i, 1, n - 1) cout << "2";
    cout << '\n';
    rep(i, 1, n - 2) {
        rep(j, 1, n) cout << '2';
        cout << '\n';
    }
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int _ = 1;
// 	cin >> _;
	while(_--) solve();
}