A Square Problem

    1#include <bits/stdc++.h>
    2using namespace std;
    3int main(){
    4    ios::sync_with_stdio(0); cin.tie(0);
    5    int n; cin >> n;
    6    vector<vector<int>> v(n, vector<int>(n));
    7    for(int i = 0; i < n; i++){
    8        for(int j = 0; j < n; j++){
    9            char c; cin >> c;
    10            int val;
    11            if(c <= 'Z' && c >= 'A'){
    12                val = int(c);
    13            } else {
    14                val = c - '0';
    15            }
    16            v[i][j]= val;
    17        }
    18    }
    19    bool latin = true;
    20    for(int i = 0; i < n; i++){
    21        unordered_set<int> vis;
    22        for(int j = 0; j < n; j++){
    23            if(vis.count(v[i][j])){
    24                latin = 0; break;
    25            }
    26            vis.insert(v[i][j]);
    27        }
    28    }
    29    for(int i = 0; i < n; i++){
    30        unordered_set<int> vis;
    31        for(int j = 0; j < n; j++){
    32            if(vis.count(v[j][i])){
    33                latin = 0; break;
    34            }
    35            vis.insert(v[j][i]);
    36        }
    37    }
    38    if(latin){
    39        bool reduced = true;
    40        for(int i = 1; i < n; i++){
    41            if(v[0][i] < v[0][i - 1]){
    42                reduced = false; break;
    43            }
    44        }
    45        for(int i = 1; i < n; i++){
    46            if(v[i][0] < v[i - 1][0]){
    47                reduced = false; break;
    48            }
    49        }
    50        if(reduced){
    51            cout << "Reduced" << '\n';
    52        } else {
    53            cout << "Latin" << '\n';
    54        }
    55    } else {
    56        cout << "No" << '\n';
    57    }
    58    return 0;
    59}