1128 N Queens Puzzle (20分)——C语言实现

最新推荐文章于 2021-05-25 05:25:54 发布

21岁被迫秃头

最新推荐文章于 2021-05-25 05:25:54 发布

阅读量163

点赞数 1

分类专栏： PAT甲级

本文链接：https://blog.csdn.net/qq_47733361/article/details/107211650

版权

PAT甲级专栏收录该内容

66 篇文章 2 订阅

订阅专栏

1128 N Queens Puzzle (20分)

The “eight queens puzzle” is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other. Thus, a solution requires that no two queens share the same row, column, or diagonal. The eight queens puzzle is an example of the more general N queens problem of placing N non-attacking queens on an N×N chessboard. (From Wikipedia - “Eight queens puzzle”.)

Here you are NOT asked to solve the puzzles. Instead, you are supposed to judge whether or not a given configuration of the chessboard is a solution. To simplify the representation of a chessboard, let us assume that no two queens will be placed in the same column. Then a configuration can be represented by a simple integer sequence (Q1 ,Q2,⋯,QN), where Qi is the row number of the queen in the i-th column. For example, Figure 1 can be represented by (4, 6, 8, 2, 7, 1, 3, 5) and it is indeed a solution to the 8 queens puzzle; while Figure 2 can be represented by (4, 6, 7, 2, 8, 1, 9, 5, 3) and is NOT a 9 queens’ solution.

Figure 1

Figure 2
在这里插入图片描述

Input Specification:

Each input file contains several test cases. The first line gives an integer K (1<K≤200). Then K lines follow, each gives a configuration in the format “N Q1 Q2 … QN”, where 4≤N≤1000 and it is guaranteed that 1≤Qi ≤N for all i=1,⋯,N. The numbers are separated by spaces.

Output Specification:

For each configuration, if it is a solution to the N queens problem, print YES in a line; or NO if not.

Sample Input:

4
8 4 6 8 2 7 1 3 5
9 4 6 7 2 8 1 9 5 3
6 1 5 2 6 4 3
5 1 3 5 2 4

Sample Output:

YES
NO
NO
YES

题目大意:

我英语还是那么菜，题目意思我只能靠猜，然后用翻译软件翻译一下，现在正在计划努力学习中，哈哈哈。大概意思如下：判断给你的数据是否满足N皇后问题，即没有两个皇后共享相同的行、列、对角线；题目已经规定列不相同，所以只判断行和对角线就可以。

代码：

#include<stdio.h>
#include<math.h>
int queen[1010]={0};
int main(){
	int K,n;
	int t,i,j;
	int flag;
	scanf("%d",&K);
	for(t=0;t<K;t++){
		flag=1;
		scanf("%d",&n);
		for(i=0;i<n;i++){
			scanf("%d",&queen[i]);
			for(j=0;j<i;j++){
				if(queen[i]==queen[j] || fabs((float)(queen[i]-queen[j]))==fabs((float)(i-j))){
					flag=0;
					break;
				}
			}
		}
		if(flag==1)
		    printf("YES\n");
		else
			printf("NO\n");
	}
	return 0;
}