Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- int x[10];
- int place(int k, int i) {
- for (int j = 1; j < k; j++) {
- if (x[j] == i || abs(x[j] - i) == abs(j - k)) {
- return 0;
- }
- }
- return 1;
- }
- void printSolution(int n) {
- printf("\nSolution is:");
- for (int j = 1; j <= n; j++) {
- printf("%2d", x[j]);
- }
- printf("\n");
- for (int i = 1; i <= n; i++) {
- for (int j = 1; j <= n; j++) {
- if (x[i] == j) {
- printf("Q%d\t", i);
- } else {
- printf("*\t");
- }
- }
- printf("\n\n");
- }
- }
- void nqueens(int k, int n) {
- for (int i = 1; i <= n; i++) {
- if (place(k, i)) {
- x[k] = i;
- if (k == n) {
- printSolution(n);
- } else {
- nqueens(k + 1, n);
- }
- }
- }
- }
- int main() {
- int n;
- printf("Enter the number of queens: ");
- scanf("%d", &n);
- if (n == 0 || n == 2 || n == 3) {
- printf("No solutions\n");
- } else {
- nqueens(1, n);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment