九度oj1164

来源：互联网发布：最小公倍数的算法编辑：程序博客网时间：2024/06/01 19:45

#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;}

0 0