1.2.2Transformations

  
    

   
     
/*
   
     
ID: awsd1231
   
     
PROG: transform
   
     
LANG: C++
   
     
*/
   
     
#include<iostream>
   
     
#include<cstdio>
   
     

   
     
using namespace std;
   
     

   
     
char square[15][15], afterSquare[15][15], tmpSquare[15][15];
   
     
int n;
   
     

   
     
bool num1() {
   
     
 for(int i = 0; i != n; ++i) {
   
     
 for(int j = 0; j != n; ++j) {
   
     
 if(tmpSquare[n-j-1][i] != afterSquare[i][j])
   
     
 return false;
   
     
 }
   
     
 }
   
     
 return true;
   
     
}
   
     

   
     
bool num2() {
   
     
 for(int i = 0; i != n; ++i) {
   
     
 for(int j = 0; j != n; ++j) {
   
     
 if(tmpSquare[n-i-1][n-j-1] != afterSquare[i][j])
   
     
 return false;
   
     
 }
   
     
 }
   
     
 return true;
   
     
}
   
     

   
     
bool num3() {
   
     
 for(int i = 0; i != n; ++i) {
   
     
 for(int j = 0; j != n; ++j) {
   
     
 if(tmpSquare[n-j-1][i] != afterSquare[i][j])
   
     
 return false;
   
     
 }
   
     
 }
   
     
 return true;
   
     
}
   
     

   
     
bool num4() {
   
     
 for(int i = 0; i != n; ++i) {
   
     
 for(int j = 0; j != n; ++j) {
   
     
 if(tmpSquare[i][n-j-1] != afterSquare[i][j])
   
     
 return false;
   
     
 }
   
     
 }
   
     
 return true;
   
     
}
   
     

   
     
bool num5() {
   
     
 for(int i = 0; i != n; ++i) {
   
     
 for(int j = 0; j != n; ++j) {
   
     
 tmpSquare[i][j] = square[i][n-1-j];
   
     
 }
   
     
 }
   
     
 if(num1()) return true;
   
     
 if(num2()) return true;
   
     
 if(num3()) return true;
   
     
 for(int i = 0; i != n; ++i) {
   
     
 for(int j = 0; j != n; ++j) {
   
     
 tmpSquare[i][j] = square[i][j];
   
     
 }
   
     
 }
   
     
 return false;
   
     
}
   
     

   
     
bool num6() {
   
     
 for(int i = 0; i != n; ++i) {
   
     
 for(int j = 0; j != n; ++j) {
   
     
 if(tmpSquare[i][j] != afterSquare[i][j])
   
     
 return false;
   
     
 }
   
     
 }
   
     
 return true;
   
     
}
   
     

   
     

   
     
int main() {
   
     
 freopen("transform.in", "r", stdin);
   
     
 freopen("transform.out", "w", stdout);
   
     
 cin >> n;
   
     
 for(int i = 0; i != n; ++i) 
   
     
 for(int j = 0; j != n; ++j) {
   
     
 cin >> square[i][j];
   
     
 tmpSquare[i][j] = square[i][j];
   
     
 }
   
     
 for(int i = 0; i != n; ++i)
   
     
 for(int j = 0; j != n; ++j)
   
     
 cin >> afterSquare[i][j];
   
     
 if(num1()) {
   
     
 cout << "1" << endl;
   
     
 return 0;
   
     
 }
   
     
 if(num2()) {
   
     
 cout << "2" << endl;
   
     
 return 0;
   
     
 }
   
     
 if(num3()) {
   
     
 cout << "3" << endl;
   
     
 return 0;
   
     
 }
   
     
 if(num4()) {
   
     
 cout << "4" << endl;
   
     
 return 0;
   
     
 }
   
     
 if(num5()) {
   
     
 cout << "5" << endl;
   
     
 return 0;
   
     
 }
   
     
 if(num6()) {
   
     
 cout << "6" << endl;
   
     
 return 0;
   
     
 }
   
     
 cout << "7" << endl;
   
     
 return 0;
   
     
}
  
    

来自为知笔记(Wiz)