0
Your rating: None
CodeChef submission 129412 (C) 

CodeChef submission 129412 (C) plaintext list. Status: CE, problem J1, contest NOV09. By abhishek agarwala (abhishek agarwala), 2009-11-10 16:35:01.
  1. #include <stdio.h>
  2.  
  3. int sudokux[9][9];
  4.  
  5. int allowed(int row, int col, int n)
  6. {
  7.   int r, c, br, bc;
  8.  
  9.   if (sudokux[row][col] == n) return 1;
  10.   if (sudokux[row][col] != 0) return 0;
  11.   for (c = 0; c < 9; c++)
  12.     if (sudokux[row][c] == n) return 0;
  13.   for (r = 0; r < 9; r++)
  14.     if (sudokux[r][col] == n) return 0;
  15.   br = row / 3;
  16.   bc = col / 3;
  17.   for (r = br * 3; r < (br + 1) * 3; r++)
  18.     for (c = bc * 3; c < (bc + 1) * 3; c++)
  19.       if (sudokux[r][c] == n) return 0;
  20.   if (row==col)
  21. 	for (r=0;r<9;r++)
  22. 		if (sudokux[r][r] = n) retuen 0;
  23.   if ((row+col )==9)
  24. 	for (r=0;r<9;r++)
  25. 		if (sudokux[r][9-r] = n) retuen 0;
  26.   return 1;
  27. }
  28.  
  29. void solve(int row, int col)
  30. {
  31.   int n, t;
  32.  
  33.   if (row == 9)
  34.     print_solution();
  35.   else
  36.     for (n = 1; n <= 9; n++)
  37.       if (allowed(row, col, n)) {
  38. 	t = sudokux[row][col];
  39. 	sudokux[row][col] = n;
  40. 	if (col == 8)
  41. 	  solve(row + 1, 0);
  42. 	else
  43. 	  solve(row, col + 1);
  44.  	sudokux[row][col] = t;
  45.       }
  46. }
  47.  
  48. int main(void)
  49. {
  50.   int n,i,j,k;
  51.   scanf("%d",&n);
  52.   for(k=0;k<n;k++)
  53.   {
  54.   for(i=0;i<9;i++)
  55.     for(j=0;j<9;j++)
  56.     {
  57.       scanf("%d", &(sudokux[i][j]));
  58.     }
  59.   solve(0,0);
  60.   for(i=0;i<9;i++)
  61. 	{
  62.     for(j=0;j<9;j++)
  63.       scanf("%d", &(sudokux[i][j]));
  64. 	printf("\n");
  65. 	}
  66.   printf("\n");
  67.   }
  68.   return 0;
  69. }

Comments