usaco/transform.cpp at master · wdskuki/usaco · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
/*
ID: dswei191
LANG: C++
TASK: transform
*/

#include <iostream>
#include <fstream>
#include <list>
#include <vector>
#include <algorithm>

using namespace std;
#define MAX_NUM 10

ofstream fout( "transform.out");
ifstream fin("transform.in");

int n;

bool type1(char before[MAX_NUM][MAX_NUM], char after[MAX_NUM][MAX_NUM]){
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(after[i][j] != before[n-j-1][i]){
                return false;
            }
        }
    }
    return true;
}

bool type2(char before[MAX_NUM][MAX_NUM], char after[MAX_NUM][MAX_NUM]){
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(after[i][j] != before[n-i-1][n-j-1]){
                return false;
            }
        }
    }
    return true;
}

bool type3(char before[MAX_NUM][MAX_NUM], char after[MAX_NUM][MAX_NUM]){
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(after[i][j] != before[j][n-i-1]){
                return false;
            }
        }
    }
    return true;
}

bool type4(char before[MAX_NUM][MAX_NUM], char after[MAX_NUM][MAX_NUM]){
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(after[i][j] != before[i][n-j-1]){
                return false;
            }
        }
    }
    return true;
}

bool type5(char before[MAX_NUM][MAX_NUM], char after[MAX_NUM][MAX_NUM]){
    char tmp[10][10];
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            tmp[i][n-j-1] = before[i][j];
        }
    }

    if(type1(tmp, after) || type2(tmp, after) || type3(tmp, after)){
        return true;
    }else{
        return false;
    }
}


bool type6(char before[MAX_NUM][MAX_NUM], char after[MAX_NUM][MAX_NUM]){
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(after[i][j] != before[i][j]){
                return false;
            }
        }
    }
    return true;
}

int checkType(char before[MAX_NUM][MAX_NUM], char after[MAX_NUM][MAX_NUM]){
    if(type1(before, after)){
        return 1;
    }else if(type2(before, after)){
        return 2;
    }else if(type3(before, after)){
        return 3;
    }else if(type4(before, after)){
        return 4;
    }else if(type5(before, after)){
        return 5;
    }else if(type6(before, after)){
        return 6;
    }else {
        return 7;
    }
}

int main(){
    fin >> n;
    char before[MAX_NUM][MAX_NUM];
    char after[MAX_NUM][MAX_NUM];
    for(int i = 0; i < n; i++){
        fin >> before[i];
    }

    for(int i = 0; i < n; i++){
        fin >> after[i];
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            cout<< before[i][j] << ' ';
        }
        cout<<endl;
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            cout<< after[i][j] << ' ';
        }
        cout<<endl;
    }


    int ret = checkType(before, after);
//    cout << ret <<endl;
    fout << ret <<endl;
//    for(int i = 0; i < n; i++){
//        for(int j = 0; j < n; j++){
//            cout<< before[i][j] << ' ';
//        }
//        cout<<endl;
//    }
    return 0;
}