Problem: Example

Input

0 3 1 7 5 9 8 6 4 2
7 0 9 2 1 5 4 8 6 3
4 2 0 6 8 7 1 3 5 9
1 7 5 0 9 8 3 4 2 6
6 1 2 3 0 4 5 9 7 8
3 6 7 4 2 0 9 5 8 1
5 8 6 9 7 2 0 1 3 4
8 9 4 5 3 6 2 0 1 7
9 4 3 8 6 1 7 2 0 5
2 5 8 1 4 3 6 7 9 0


Output

0

Solution (in CPP):

Solution:
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    vector<vector<int>> table(10, vector<int>(10));
    for(int i=0; i<10; ++i) {
        for(int j=0; j<10; ++j) {
            cin >> table[i][j];
        }
    }
    auto cd = [&table](string const& n, int len) -> char {
        int res = 0;
        for(int i=0; i<len; ++i) {
            res = table[res][n[i]-'0'];
        }
        return (char)(res + '0');
    };
    vector<bool> error(10000, false);
    for(int i=0; i<10000; ++i) {
        string n = to_string(i);
        while(n.size() < 4) {
            n = '0' + n;
        }
        n += cd(n, 4);

        for(int j=0; j<5; ++j) {
            string tmp = n;
            for(int k=0; k<10; ++k) {
                tmp[j] = '0' + k;
                if(tmp == n) {
                    continue;
                }
                char c2 = cd(tmp, 5);
                if(c2 == '0') {
                    error[stoi(n.substr(0, 4))] = true;
                }
            }
        }

        for(int j=0; j<4; ++j) {
            if(n[j] == n[j+1]) {
                continue;
            }
            swap(n[j], n[j+1]);
            if(cd(n, 5) == '0') {
                error[i] = true;
            }
            swap(n[j], n[j+1]);
        }
    }

    cout << count(error.begin(), error.end(), true) << endl;
}