Red Huang

Red Huang

uva 11349

水題

//============================================================================  
// Name        : Symmetric Matrix.cpp  
// Date : 2013/5/11 下午9:31:32  
// Author : GCA  
//============================================================================  
#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <algorithm>  
#include <cmath>  
#include <climits>  
#include <vector>  
#include <set>  
#include <map>  
#include <queue>  
#include <cctype>  
#include <utility>  
using namespace std;  
#ifdef ONLINE\_JUDGE  
#define ll "%lld"  
#else  
#define ll "%I64d"  
#endif  
typedef unsigned int uint;  
typedef long long int Int;  
#define Set(a,s) memset(a,s,sizeof(a))  
#define Write(w) freopen(w,"w",stdout)  
#define Read(r) freopen(r,"r",stdin)  
#define Pln() printf("\\n")  
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()  
#define De(x)printf(#x"%d\\n",x)  
#define For(i,x)for(int i=0;i<x;i++)  
#define CON(x,y) x##y  
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\  
    printf("%d ",dp\[htx\]\[hty\]);}Pln();}  
#define M 150  
#define PII pair<int,int\>  
#define PB push\_back  
#define oo INT\_MAX  
#define Set\_oo 0x3f  
#define Is\_debug true  
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)  
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)  
#define eps 1e-6  
bool xdy(double x,double y){return x>y+eps;}  
bool xddy(double x,double y){return x>y-eps;}  
bool xcy(double x,double y){return x<y-eps;}  
bool xcdy(double x,double y){return x<y+eps;}  
int min3(int x,int y,int z){  
    int tmp=min(x,y);  
    return min(tmp,z);  
}  
int max3(int x,int y,int z){  
    int tmp=max(x,y);  
    return max(tmp,z);  
}  
int n;  
Int mz\[M\]\[M\];  
bool solve(){  
    Int tmp\[M\];  
    for(int i=0;i<=n/2;i++){  
        for(int j=0;j<n;j++)tmp\[j\]=mz\[i\]\[j\];  
        for(int j=0;j<n;j++){  
            if(tmp\[n-j-1\]!=mz\[n-i-1\]\[j\]){  
                return false;  
            }  
        }  
    }  
    return true;  
}  
int main() {  
    ios\_base::sync\_with\_stdio(0);  
    int test,ff=0;  
    scanf("%d%\*c",&test);  
    while(test--){  
        int fg=0;  
        scanf("N = %d%\*c",&n);  
        for(int i=0;i<n;i++){  
            for(int j=0;j<n;j++){  
                scanf("%lld",&mz\[j\]\[i\]);  
                if(mz\[j\]\[i\]<0)fg=1;  
            }  
        }getchar();  
        if(solve()&&fg==0)printf("Test #%d: Symmetric.\\n",++ff);  
        else printf("Test #%d: Non-symmetric.\\n",++ff);  
  
    }  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
}  

Loading...
Ownership of this post data is guaranteed by blockchain and smart contracts to the creator alone.