CSES Problemset/Introductory Problems
Chessboard and Queens
#1624Ask AI
Open a hint-first prompt in a new AI chat. Grok may ask you to confirm before sending.
Open Claude DesktopYour task is to place eight queens on a chessboard so that no two queens are attacking each other. As an additional challenge, each square is either free or reserved, and you can only place queens on the free squares. However, the reserved squares do not prevent queens from attacking each other.
How many possible ways are there to place the queens?
Input
The input has eight lines, and each of them has eight characters. Each square is either free (.) or reserved (*).
Output
Print one integer: the number of ways you can place the queens.
Sample Test Cases (1)
Example 1ID: sample-1
Input
........ ........ ..*..... ........ ........ .....**. ...*.... ........
Expected Output
65
Tools
1
2
3
4
5
6
7
8
9
10
11
12
Draft saved locally
|1 line, 0 charsTest Bench
Input (stdin)
........ ........ ..*..... ........ ........ .....**. ...*.... ........
Expected Output
65