|Online MIPT programming contest||РУССКИЙ|
Time limit = 2 second(s)
Memory limit = 33000 KbYou are to find the number of different combinations of placement of N queens on the N x N board. Every queen should NOT attack another (i.e. there should be no two figures sharing the same vertical, horizontal or diagonal.
Input. Number 1 ≤ N ≤ 15.
Output. The number of valid combinations.
4 March 2005
© acm.mipt DevGroup
The page was generated in 210ms