#include <cstdlib>
#include <iostream>
#include <fstream>
#include <iomanip>

using namespace std;

void open_input_file (ifstream &in_f);
void read_input (ifstream &in_f, int puzzle[][9], int size);
bool check_row (int puzzle[][9], int size);
bool check_column (int puzzle[][9], int size);
bool check_region (int puzzle[][9], int size);
void bubblesort (int list [], int size);
void bubbleup (int list [], int index, int last);


const int size = 9;

int main()
{
ifstream input;
int sudoku [size][size];
bool answer_row, answer_column, answer_region;

open_input_file (input);
read_input (input, sudoku, size);
answer_row = check_row (sudoku, size);
answer_column = check_column (sudoku, size);
answer_region = check_region (sudoku, size);

if (answer_row == true && answer_column == true && answer_region == true)
cout << "The solution to the sudoku is correct" <<endl;
else
cout << "The solution to the sodoku is incorrect" << endl;


return 0;
}


void open_input_file (ifstream &in_f)
{
char input_file_name[80];

do
{ in_f.clear();
	cout << "Enter input file name: ";
	cin >> input_file_name;
	in_f.open(input_file_name);
} while ( in_f.fail() );


return;
}


void read_input (ifstream &in_f, int puzzle[][9], int size)
{

int ch;

    for (int i = 0; i < 9; i++) 
    {
        for (int j = 0; j < 9; j++) 
	{
            in_f >> ch;
	    {
            if (isdigit(ch)); 
            puzzle[i][j] = ch;
	    }
        }
    }


return ;
}

bool check_row (int puzzle[][9], int size)
{
int row[size];

for (int i=0; i < 9; i++)
{
	for(int j=0; j < 9; j++)
	row[j] = puzzle[i][j];
bubblesort (row, size);

    for (int k=0; k < 9; k++)
    {
    if (row[k] != k+1)
    return false;
    }
}
return true;
}

bool check_column (int puzzle[][9], int size)
{
int column[size];

for (int i=0; i < 9; i++)
{
        for(int j=0; j < 9; j++)
        column[j] = puzzle[j][i];
bubblesort (column, size);

    for (int k=0; k < 9; k++)
    {
    if (column[k] != k+1)
    return false;
    }
}
return true;
}

bool check_region (int puzzle[][9], int size)
{
int region[size];
int a = 0;

for (int i=0; i < 9;  i=i+3)
{
    for (int j=0; j < 9; j=j+3)
    {
	for (int k=0; k < 3; k++)
	{
	    for (int l=0; l < 3; l++)
	    {
		region [a] = puzzle[k+i][l+j];
	    }
	}
    }
}

bubblesort (region, size);

    for (int k=0; k < 9; k++)
    {
    if (region[k] != k+1)
    return false;
    }

return true;
}


// SORTING FUNCTION
void bubblesort(int list [], int size)
{
        for(int index = 0; index < size; index++)
                bubbleup(list, index, size);
        return;
}

        // SECOND PART OF THE SORTING FUNCTION
        void bubbleup (int list [], int index, int last)
        {

                for (int walker = last; walker > index; walker--)
                        if (list [walker] < list [walker-1])
                        {
                        char temp = list [walker];
                        list [walker] = list [walker - 1];
                        list [walker -1] = temp;
                        }
        return;
        }

bool check_region(int puzzle[][9], int size)
{
    int region[size];
    int a = 0;

    for (int i = 0; i < 9; i = i + 3) {
        for (int j = 0; j < 9; j = j + 3) {
            for (int k = 0; k < 3; k++) {
                for (int l = 0; l < 3; l++) {
                    cout << "l = " << l
                         << ", j = " << j
                         << ", k = " << k
                         << ", i = " << i
                         << ", a = " << a
                         << ", k+i = " << k+i
                         << ", l+j = " << l+j
                         << ", a = " << a
                         << endl;
                    region[a] = puzzle[k + i][l + j];
                }
            }
        }
    }
}