#include #include #include #include int main() { int solutions[8][9] = { {2,7,6,9,5,1,4,3,8}, {6,7,2,1,5,9,8,3,4}, {4,9,2,3,5,7,8,1,6}, {2,9,4,7,5,3,6,1,8}, {6,1,8,7,5,3,2,9,4}, {8,1,6,3,5,7,4,9,2}, {8,3,4,1,5,9,6,7,2}, {4,3,8,9,5,1,2,7,6}, }; int minCost = 999999; int tempCost; int square[9]; for (int i = 0; i < 9; i++) { scanf("%d", square+i); } for (int i = 0; i < 8; i++) { tempCost = 0; for (int j = 0; j < 9; j++) { tempCost += abs(square[j]-solutions[i][j]); } if (tempCost < minCost) { minCost = tempCost; } } printf("%d", minCost); return 0; }