acdream 1195

題目鏈接：點擊打開鏈接

題意：略，水題實現略有小技巧，提高代碼能力

cpp:點擊打開鏈接

/*
* this code is made by ppaul
* Problem: 1195
* Verdict: Accepted
* Submission Date: 2014-08-29 20:33:34
* Time: 20MS
* Memory: 1132KB
*/
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
#define maxn 40
int T,n,data[maxn][maxn];
int mark[10010];
int main()
{
    int i,j,k;
    //freopen("data.in","r",stdin);
    scanf("%d",&T);
    int cas=0;
    while (T--)
    {
        int ans=1;
        scanf("%d",&n);
        for(i=0;i<n*n;i++)
        {
            memset(mark,0,sizeof(mark));
            for(j=0;j<n*n;j++)
            {
                scanf("%d",&data[i][j]);
                mark[data[i][j]]=1;
            }
            for(j=1;j<=n*n;j++)
            {
                if(mark[j]==0)
                {
                    ans=-1;
                    //printf("%d %d\n",i,j);
                }
            }
        }
        for(i=0;i<n*n;i++)
        {
            memset(mark,0,sizeof(mark));
            for(j=0;j<n*n;j++)
            {
                mark[data[j][i]]=1;
            }
            for(j=1;j<=n*n;j++)
            {
                if(mark[j]==0)
                {
                    ans=-1;
                }
            }
        }
        for(i=0;i<n*n;i++)
        {
            int tp=(i%n)*n;
            int tp2=(i/n)*n;
            memset(mark,0,sizeof(data));
            for(j=tp;j<n+tp;j++)
            {
                for(k=tp2;k<tp2+n;k++)
                {
                    mark[data[k][j]]=1;
                }
            }
            for(j=1;j<=n*n;j++)
            {
                if(mark[j]==0)
                {
                    ans=-1;
                }
            }
        }
        if(ans==1)
        {
            printf("Case #%d: Yes\n",++cas);
        }
        else {
            printf("Case #%d: No\n",++cas);
        }
         
    }
    return 0;
}