算法
(模拟)
C++ 代码
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector a(h, vector<int>(w));
rep(i, h)rep(j, w) cin >> a[i][j];
vector<string> s(h, string(w, '.'));
rep(i, h)rep(j, w) {
if (a[i][j] == 0) continue;
s[i][j] = 'A'+a[i][j]-1;
}
rep(i, h) cout << s[i] << '\n';
return 0;
}