Submission #40079354

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <tuple>
#include <unordered_map>
#define x first
#define y second
#define speedup (ios::sync_with_stdio(0), cin.tie(0), cout.tie(0))
#define INF 0x3f3f3f3f
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;

const int N = 1e5 + 10;

int main()
{
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i ++, cout << endl)
    {
        for(int j = 1; j <= m; j ++)
        {
            int x;
            cin >> x;
            if(x == 0) cout << '.';
            else cout << (char)(x + 'A' - 1);
        }
    }

    return 0;
}

Submission Info

Judge Result