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 <bits/stdc++.h>

using namespace std;

#define int long long
#define F first
#define S second
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)
#define each(a, b) for(auto& a : b)

typedef pair<int, int> P;

const int inf = 1LL << 55;

int x[10][10];

bool check(string ssn)
{
  int f = 0;
  rep(i, 5) f = x[f][ssn[i]-'0'];
  return f == 0;
}

signed main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  rep(i, 10) rep(j, 10) cin >> x[i][j];

  int ans = 0;
  rep(i, 10000) {
    string id = to_string(i);
    while(id.size() < 4) id = "0" + id;
    int e = 0;
    rep(j, 4) e = x[e][id[j]-'0'];
    id += (e + '0');
    bool flag = false;
    rep(j, 5) rep(k, 10) {
      char tmp = id[j], num = k+'0';
      if(tmp == num) continue;
      id[j] = num;
      if(check(id)) flag = true;
      id[j] = tmp;
    }
    rep(i, 4) {
      if(id[i] == id[i+1]) continue;
      swap(id[i], id[i+1]);
      if(check(id)) flag = true;
      swap(id[i], id[i+1]);
    }
    if(flag) ans++;
  }
  cout << ans << endl;

  return 0;
}