Advertisement
Guest User

Untitled

a guest
Mar 5th, 2015
176
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.73 KB | None | 0 0
  1. #include<stdio.h>
  2. #include<math.h>
  3. int column[20],count,n,a[20][20];
  4. bool find_position(int row,int col)
  5. {
  6. for(int i=1;i<=row;i++)
  7. if((abs(row - i) == abs(col - column[i])) || (col == column[i]))
  8. return false;
  9. return true;
  10. }
  11. int print_solution()
  12. {
  13. count++; printf("%d\n",count);
  14. for(int i=1;i<=n;i++)
  15. {for(int j =1;j<=n;j++)
  16. printf("%d ",a[i][j]); printf("\n");}
  17. printf("\n");
  18. }
  19. int find_queen(int row)
  20. {
  21. for(int col=1;col<=n;col++)
  22. {
  23. if(find_position(row,col))
  24. {
  25. column[row]=col;
  26. a[row][col]=1;
  27. for(int i =1;i<column[1];i++) a[1][i] = 0;
  28. if (row==n) print_solution();
  29. else find_queen(row+1);
  30. }
  31. else a[row][col]=0;
  32. }
  33. }
  34. int main()
  35. {
  36. count=0;
  37. n=4;
  38. find_queen(1);
  39. getchar();
  40. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement