T求解

#include <iostream>
using namespace std;
int n, a[10][5];
bool flag[100005] = {false};
void check1()
{
	for (int i = 1;i <= n;i++)
	{
		for (int j = 1;j <= 5;j++)
		{
			int b = a[i][j];
			b++;
			int num = 0;
			while (b != a[i][j])
			{
				num = 0;
				for (int k = 1;k <= j - 1;k++)
				{
					num = num * 10 + a[i][k];
				}
				num = num * 10 + b;
				for (int k = j + 1;k <= 5;k++)
				{
					num = num * 10 + a[i][k];
				}
				b++;
				b %= 10;
				flag[num] = true;
			}
		}
	}
}
void check2()
{
	for (int i = 1;i <= n;i++)
	{
		for (int j = 1;j <= 4;j++)
		{
			int b = a[i][j];
			int c = a[i][j + 1];
			b++;c++;
			int num = 0;
			while (b != a[i][j] && c != a[i][j + 1])
			{
				num = 0;
				for (int k = 1;k <= j - 1;k++)
				{
					num = num * 10 + a[i][k];
				}
				num = num * 100 + b * 10 + c;
				for (int k = j + 2;k <= 5;k++)
				{
					num = num * 10 + a[i][k];
				}
				flag[num] = true;
				b++;c++;
				b %= 10;
				c %= 10;
			}
		}
	}
}
int main()
{
    
    cin >> n;
    for (int i = 1;i <= n;i++)
    {
        for (int j = 1;j <= 5;j++)
        {
            cin >> a[i][j];
        }
    }
    check1();
	check2();
    int num = 0;
    for (int i = 0;i <= 99999;i++)
    {
    	if (flag[i])
    	{
    		num++;
		}
	}
	cout << num;
    return 0;
}