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
#include<stdio.h>
long long A[10][110][110],B[110][110];
int n;
int ans;
int cmp(int p,int x,int y,int z)
{
    int i,j,k,l;
    long long m;
    long long mina,minb,maxa,maxb;
    long long xa,xb;
    m=1;
    mina=maxa=A[p][x][y];
    minb=maxb=B[x][y];
    xa=xb=0;
    for(i=x;i<x+z;i++)
    {
        for(j=y;j<y+z;j++)
        {
            if(A[p][i][j]!=B[i][j])m=0;
            xa=xa xor A[p][i][j];
            xb=xb xor B[i][j];
            /*
            if(A[p][i][j]>maxa)maxa=A[p][i][j];
            if(A[p][i][j]<mina)mina=A[p][i][j];
            if(B[i][j]>maxb)maxb=B[i][j];
            if(B[i][j]<minb)minb=B[i][j];
            //*/
        }
    }
    
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX