//Sudoku - Runar Furenes, versjon 2

import easyIO.*;

class SudokuRunarfu {

    public static void main(String[] args){

        Out skjerm = new Out();

        if (args.length == 0)
        {
            System.out.print("Bruk:  java SudokuRunarfu <filnavn>");
            System.exit(1);
        }
        In innData = new In(args[0]);
        boolean solvedAny = true;
        int[][] tall = new int[9][9];
        int gjennomlop = 0;

        for(int i=0; i<9; i++)
        {
            for(int j=0; j<9; j++)
            {
                tall[i][j] = innData.inInt();
            }//for
        }//for

        skjerm.outln("\nF?r kj?ring: ");
        for(int rad=0; rad<9; rad++)
        {
            for(int kol=0; kol<9; kol++)
            {
                skjerm.out(tall[rad][kol] + " ");
            }//for
            skjerm.outln("");
        }//for
        skjerm.outln("");

        while(solvedAny)
        {
	    solvedAny = false;
            for(int rad=0; rad<9; rad++)
            {

                for(int kol=0; kol<9; kol++)
                {
                    int[] muligeTall = {0,1,2,3,4,5,6,7,8,9};
                    //Finn tall i samme rad:
                    for(int i=0; i<9; i++)
                    {
                        if(tall[rad][i]!=0) muligeTall[tall[rad][i]] = 0;

                    }//for


                    //Finn tall i samme kolonne:
                    for(int i=0; i<9; i++)
                    {
                        if(tall[i][kol]!=0) muligeTall[tall[i][kol]] = 0;
                    }//for

                    //Finn tall i samme 3x3-felt:
                    int senter_rad = 0;
                    int senter_kol = 0;
                    if(rad >=0 && rad < 3) senter_rad = 1;
                    if(rad >=3 && rad < 6) senter_rad = 4;
                    if(rad >=6 && rad < 9) senter_rad = 7;
                    if(kol >=0 && kol < 3) senter_kol = 1;
                    if(kol >=3 && kol < 6) senter_kol = 4;
                    if(kol >=6 && kol < 9) senter_kol = 7;

                    for(int i=senter_rad-1;i<senter_rad+2; i++)
                    {

                        for(int j=senter_kol-1; j<senter_kol+2; j++)
                        {
                            if(tall[i][j]!=0 && !(i==rad && j==kol)) muligeTall[tall[i][j]] = 0;

                        }//for
                    }//for

                    if(tall[rad][kol]==0)
                    {
                        int antallMulige = 0;
                        int rettTall = 0;
                        skjerm.outln("Mulige tall for felt " + (rad + 1) +
				     "," + (kol + 1) + " er ");
                        for(int i=0; i<10; i++)
                        {
                            if(muligeTall[i] != 0)
                            {
                                skjerm.out(muligeTall[i] + " ");
                                antallMulige++;
                                rettTall = muligeTall[i];

                            }//if
                        }//for
                        if(antallMulige == 1)
                        {
                            tall[rad][kol] = rettTall;
			    solvedAny = true;
                        }//if
                        skjerm.outln("");
                    }//if
                }//for kol


            }//for rad





        }//while !solved

        skjerm.outln("\nEtter kj?ring:");

        for(int rad=0; rad<9; rad++)
        {
            for(int kol=0; kol<9; kol++)
            {
                skjerm.out(tall[rad][kol] + " ");
            }//for
            skjerm.outln("");
        }//for


    } //end main

} //end class Sudoku