All Tracks Basic Programming Recursion Recursion and Backtracking Problem

N-Queens
Tag(s):

Backtracking, Easy

Problem
Editorial
Analytics

Given a chess board having $$N \times N$$ cells, you need to place $$N$$ queens on the board in such a way that no queen attacks any other queen.

Input:
The only line of input consists of a single integer denoting $$N$$.

Output:
If it is possible to place all the $$N$$ queens in such a way that no queen attacks another queen, then print $$N$$ lines having $$N$$ integers. The integer in $$i^{th}$$ line and $$j^{th}$$ column will denote the cell $$(i,j)$$ of the board and should be $$1$$ if a queen is placed at $$(i,j)$$ otherwise $$0$$. If there are more than way of placing queens print any of them. If it is not possible to place all $$N$$ queens in the desired way, then print "Not possible" (without quotes).

Constraints:
$$1 \le N \le 10$$.

SAMPLE INPUT
4
SAMPLE OUTPUT
0 1 0 0 
0 0 0 1 
1 0 0 0 
0 0 1 0 
Time Limit: 1.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB
Marking Scheme: Marks are awarded when all the testcases pass.
Allowed Languages: C, C++, C++14, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, JavaScript(Rhino), JavaScript(Node.js), Julia, Kotlin, Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, R(RScript), Racket, Ruby, Rust, Scala, Swift, Visual Basic

CODE EDITOR

Initializing Code Editor...
Your Rating:

Contributor

Notifications
View All Notifications