Transformations 方块转换

#include <iostream>
using namespace std;


int main(int argc, char const *argv[])
{
	char beforegraph[11][11];
	char aftergraph[11][11];
	int n;
	cout<<"N?"<<endl;
	cin>>n;
	int i,j;
	char c;
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
		{
			cin>>c;
			beforegraph[i][j] = c;
		}
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
		{
			cin>>c;
			aftergraph[i][j] = c;
		}
	int count1 = 0,count2 = 0,count3 = 0,count4 = 0,count5 = 0,count6 = 0;
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
		{
			if(beforegraph[i][j] == aftergraph[j][n-i+1])
				count1++;
			if(beforegraph[i][j] == aftergraph[n-i+1][n-j+1])
				count2++;
			if(beforegraph[i][j] == aftergraph[n-j+1][i])
				count3++;
			if(beforegraph[i][j] == aftergraph[n-j+1][n-i+1])
				count4++;
			if(beforegraph[i][j] == aftergraph[n-i+1][j])
				count5++;
			if(beforegraph[i][j] == aftergraph[j][i])
				count6++;
		}
	if(count1 == n*n)
		cout<<'1'<<endl;
	else if(count2 == n*n)
		cout<<'2'<<endl;
	else if(count3 == n*n)
		cout<<'3'<<endl;
	else if(count4 == n*n)
		cout<<'4'<<endl;
	else if(count5 == n*n)
		cout<<'5'<<endl;
	else if(count6 == n*n)
		cout<<'6'<<endl;
	else cout<<'7'<<endl;

	return 0;
}