Problem 2693 --13_A : 8 Queens Problem

2693: 13_A : 8 Queens Problem

上一题 正确率: $INF\%$ 下一题
"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $0$ 正确数量 $1$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签 STL

Description

8 Queens Problem 

The goal of 8 Queens Problem is to put eight queens on a chess-board such that none of them threatens any of others. A queen threatens the squares in the same row, in the same column, or on the same diagonals as shown in the following figure. 

For a given chess board where k queens are already placed, find the solution of the 8 queens problem.

Input

In the first line, an integer k is given. In the following k lines, each square where a queen is already placed is given by two integers r and c. r and c respectively denotes the row number and the column number. The row/column numbers start with 0.

Output

Print a 8×8 chess board by strings where a square with a queen is represented by 'Q' and an empty square is represented by '.'.

Sample Input复制

2
2 2
5 3

Sample Output复制

......Q.
Q.......
..Q.....
.......Q
.....Q..
...Q....
.Q......
....Q...

提示

There is exactly one solution

推荐代码 查看2693 所有题解 上传题解视频得图灵币

本题记录 用 户（点击查看用户） 运行号（点击购买题解） 时 间
算法最快[$4 $ms] AOJ大管家 1163851 2025-01-14 19:42:46
内存最少[$1228 $KB] AOJ大管家 1163851 2025-01-14 19:42:46
第一AC AOJ大管家 1163851 2025-01-14 19:42:46
第一挑战 AOJ大管家 1163851 2025-01-14 19:42:46

赛题来源/所属竞赛 会津大学《挑战数据结构与算法》 挑战数据结构与算法

竞赛编号 竞赛名称 竞赛时间 访问比赛