九度oj1164

最新推荐文章于 2025-06-09 00:09:22 发布

lucky-

最新推荐文章于 2025-06-09 00:09:22 发布

阅读量232

点赞数

文章标签： c语言

本文链接：https://blog.csdn.net/laptoper/article/details/59745105

版权

#include<stdio.h>
int judge0(int n,int p[], int q[]){
	int n2 = n*n;
	for (int i = 0; i < n2; i++)
	{
		if (p[i] != q[i])return 0;
	}
	return 1;
}
int judge90(int n, int p[], int q[]){

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			if (p[i*n + j] != q[n*j + n - i - 1])
				return 0;
		}
	}
	return 1;
}
int judge180(int n, int p[], int q[]){
	int n2 = n*n;
	for (int i = 0; i < n2; i++)
	{
		if (p[i] != q[n2 - i - 1])return 0;
	}
	return 1;
}
int judge270(int n, int p[], int q[]){

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			if (p[i*n + j] != q[(n-j-1)*n+i])return 0;
		}
	}
	return 1;
}
int main(){
	int n;
	while (scanf("%d", &n) != EOF)
	{
		int p[100], q[100];
		int n2 = n*n;
		for (int i = 0; i < n2; i++)scanf("%d", &p[i]);
		for (int i = 0; i < n2; i++)scanf("%d", &q[i]);
		if (judge0(n, p, q) != 0)printf("0\n");
		else if (judge90(n, p, q) != 0)printf("90\n");
		else if (judge180(n, p, q) != 0)printf("180\n");
		else if (judge270(n, p, q) != 0)printf("270\n");
		else printf("-1\n");
	}
	return 0;
}