1、2、7 WA，其它AC

#include <bits/stdc++.h>
using namespace std;
int main(){
	int n;
	cin>>n;
	char a[11][11] = {};
	for(int i = 1;i<=n;++i){
		for(int j = 1;j<=n;++j){
			cin>>a[i][j];
		}
	}
	char now[11][11] = {};
	for(int i = 1;i<=n;++i){
		for(int j = 1;j<=n;++j){
			cin>>now[i][j];
		}
	}
	int b[11] = {};
	for(int i = 1;i<=n;++i){
		for(int j = 1;j<=n;++j){
			if(now[j][(n+1)-i] != a[i][j] && b[1]==0){
				b[1] = 1;
			}
			if(now[(n+1)-i][(n+1)-j] != a[i][j] && b[2]==0){
				b[2] = 1;
			}
			if(now[(n+1)-j][i] != a[i][j] && b[3]==0){
				b[3] = 1;
			}
			if(now[i][(n+1)-j] != a[i][j] && b[4]==0){
				b[4] = 1;
			}
			if(now[i][j] != a[i][j] && b[6]==0){
				b[6] = 1;
			}
		}
	}
	if(!b[1]){
		cout<<1;
		return 0;
	}
	if(!b[2]){
		cout<<2;
		return 0;
	}
	if(!b[3]){
		cout<<3;
		return 0;
	}
	if(!b[4]){
		b[1] = 0;
		b[2] = 0;
		b[3] = 0;
		for(int i = 1;i<=n;++i){
			for(int j = 1;j<=n;++j){
				if(now[j][(n+1)-i] != a[i][j] && b[1]==0){
					b[1] = 1;
				}
				if(now[(n+1)-i][(n+1)-j] != a[i][j] && b[2]==0){
					b[2] = 1;
				}
				if(now[(n+1)-j][i] != a[i][j] && b[3]==0){
					b[3] = 1;
				}
			}
		}
		if(!b[1]||!b[2]||!b[3]){
			cout<<5;
			return 0;
		}else{
			cout<<4;
			return 0;
		}
	}
	if(b[6]){
		cout<<6;
		return 0;
	}
	cout<<7;
    return 0;
}

又臭又长