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 <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>
#include <random>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
template<typename T> inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;
const double EPS = 1e-9;
FILE *fp;

void init();
void last();

int x[10][10];
void init() {
#ifdef MYLOCAL
    if ((fp = freopen("/Users/sekiya9311/Documents/comp_programming/comp_programming/in.txt", "r", stdin)) == NULL) {
        assert(false);
    }
#endif
    for (int i = 0; i < 10; i++) {
        for (int j = 0; j < 10; j++) {
            scanf("%d", &x[i][j]);
        }
    }
    int ans = 0;
    for (int i = 0; i < 10; i++) {
        for (int j = 0; j < 10; j++) {
            for (int k = 0; k < 10; k++) {
                for (int l = 0; l < 10; l++) {
                    bool ok = true;
                    const int e = x[x[x[x[0][i]][j]][k]][l];
                    for (int m = 0; m < 10; m++) {
                        if (i != m && x[x[x[x[x[0][m]][j]][k]][l]][e] == 0) ok = false;
                        if (j != m && x[x[x[x[x[0][i]][m]][k]][l]][e] == 0) ok = false;
                        if (k != m && x[x[x[x[x[0][i]][j]][m]][l]][e] == 0) ok = false;
                        if (l != m && x[x[x[x[x[0][i]][j]][k]][m]][e] == 0) ok = false;
                        if (e != m && x[x[x[x[x[0][i]][j]][k]][l]][m] == 0) ok = false;
                    }
                    vector<int> v{i, j, k, l, e};
                    for (int m = 0; m < 4; m++) {
                        if (v[m] != v[m + 1]) {
                            swap(v[m], v[m + 1]);
                            if (x[x[x[x[x[0][v[0]]][v[1]]][v[2]]][v[3]]][v[4]] == 0) {
                                ok = false;
                            }
                            swap(v[m], v[m + 1]);
                        }
                    }
                    ans += !ok;
                }
            }
        }
    }
    printf("%d\n", ans);
    last();
}

void last() {
#ifdef MYLOCAL
    fclose(fp);
#endif
    exit(0);
}

void solve(int n) {
    
    last();
}

signed main(void) {
    LL n, m, p, a, b, c, x, y, z, q;
    string s;
    bool f = false;
    init();
    while (cin >> n, n) {
        solve(n);
        //return 0;
    }
    last();
}