/* Written by: Andrew Elgert Michael Lu TJ Mercier Drew Tyler and Bryan Wang 2006 GCC */ #include #include using namespace std; int find(int in, int check[9]) { int i; for(i=0;i<9;i++) { if(in == check[i]) { in++; i = 0; } } return in; } int atoi (char a) { return (a-'0'); } main() { char input[9];//: first[9]; int i, j = 0, k, l, flag = 0, separate, min = 9,in=1; int present[3][9], check[9]; for(i = 0; i < 9; i++) { check[i] = -1; } cout << "Enter your first row of numbers:"; cin >> input; for (i = 0; i < 9; i++) { present[0][i] = atoi(input[i]); } i = 0; for (i = 0; i < 9; i++) { if (present[0][i] != 0) { check[j] = present[0][i]; j++; } } for(i=0; i<9; i++) { if(present[0][i] == 0) { present[0][i] = find(in, check); in = find(in, check) + 1; } } for (i = 0; i < 9; i++) cout << present[0][i]; cout << "\n"; j = 0; for (i = 6; i < 9; i++) { present[1][j] = present[0][i]; j++; } for (i = 0; i < 3; i++) { present[1][j] = present[0][i]; j++; } for (i = 3; i < 6; i++) { present[1][j] = present[0][i]; j++; } j = 0; for (i = 3; i < 6; i++) { present[2][j] = present[0][i]; j++; } for (i = 6; i < 9; i++) { present[2][j] = present[0][i]; j++; } for (i = 0; i < 3; i++) { present[2][j] = present[0][i]; j++; } for (i = 0; i < 9; i++) { cout << present[1][i]; } cout << "\n"; for (i = 0; i < 9; i++) { cout << present[2][i]; } cout << "\n"; }