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 rep(i,n) for(int i=0;i<n;++i)

int t[10][10],a[5];

int check(int k){
	if(k==0)return t[0][a[k]];
	return t[check(k-1)][a[k]];
}

int main(void){
	int cnt=0;
	rep(i,10)rep(j,10)cin>>t[i][j];
	rep(n,10000){
		bool flag=false;
		int d=1000;
		a[0]=n;
		rep(k,4){
			a[k+1]=a[k]%d;
			a[k]/=d;
			d/=10;
		}
		a[4]=check(3);

		/* Altering one single digit */
		rep(k,5){
			int tmp=a[k];
			rep(i,10){
				if(i==tmp)continue;
				a[k]=i;
				if(check(4)==0)flag=true;
			}
			a[k]=tmp;
		}

		/* Transposing two adjacent digits */
		rep(k,4){
			if(a[k]==a[k+1])continue;
			swap(a[k],a[k+1]);
			if(check(4)==0)flag=true;
			swap(a[k],a[k+1]);
		}

		if(flag)cnt++;
	}
	cout<<cnt<<endl;

	return 0;
}