本文共 1789 字，大约阅读时间需要 5 分钟。
/**/#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define LL long long#define rep1(i,a,b) for (int i = a;i <= b;i++)#define rep2(i,a,b) for (int i = a;i >= b;i--)#define mp make_pair#define pb emplace_back#define fi first#define se second#define ld long double#define ms(x,y) memset(x,y,sizeof x)#define ri(x) scanf("%d",&x)#define rl(x) scanf("%lld",&x)#define rs(x) scanf("%s",x)#define rf(x) scnaf("%lf",&x)#define oi(x) printf("%d",x)#define ol(x) printf("%lld",x)#define oc putchar(' ')#define os(x) printf(x)#define all(x) x.begin(),x.end()#define Open() freopen("F:\\rush.txt","r",stdin)#define Close() ios::sync_with_stdio(0)#define sz(x) ((int) x.size())#define ld long doubletypedef pair pii;typedef pair pll;//mt19937 myrand(time(0));//int get_rand(int n){return myrand()%n + 1;}const int dx[9] = {0,1,-1,0,0,-1,-1,1,1};const int dy[9] = {0,0,0,-1,1,-1,1,-1,1};const double pi = acos(-1.0);const int N = 110;int n,a[N+10][N+10],b[N+10][N+10];bool ok(){ rep1(i,1,n) rep1(j,1,n) if (a[i][j]!=b[i][j]){ return false; } return true;}void shui(){ rep1(i,1,n/2) rep1(j,1,n) swap(a[i][j],a[n-i+1][j]);}void shu(){ rep1(j,1,n/2){ rep1(i,1,n) swap(a[i][j],a[i][n-j+1]); }}int main(){ //Open(); //Close(); ri(n); rep1(i,1,n) rep1(j,1,n) ri(a[i][j]); rep1(i,1,n) rep1(j,1,n) ri(b[i][j]); shui(); if (ok()){ puts("1"); return 0; } shui(); shu(); if (ok()){ puts("1"); return 0; } puts("0"); return 0;}
转载于:https://www.cnblogs.com/AWCXV/p/7626044.html