UVa : 12036 (Stable Grid)

// http://uva.onlinejudge.org/external/120/12036.html
// Runtime: 0.036s
// Tag: Pigeon hole principal, Adhoc

// @BEGIN_OF_SOURCE_CODE

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#include <numeric>

#define INF_MAX 2147483647
#define INF_MIN -2147483647
#define pi acos(-1.0)
#define N 1000000
#define LL long long

#define For(i, a, b) for( int i = (a); i < (b); i++ )
#define Fors(i, sz) for( size_t i = 0; i < sz.size (); i++ )
#define Fore(it, x) for(typeof (x.begin()) it = x.begin(); it != x.end (); it++)
#define Set(a, s) memset(a, s, sizeof (a))
#define Read(r) freopen(r, "r", stdin)
#define Write(w) freopen(w, "w", stdout)

int dr [] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dc [] = {0, 1, 1, 1, 0, -1, -1, -1};

using namespace std;

int main ()
{
    int testCase; scanf ("%d", &testCase);
    int cases = 0;

    while ( testCase-- ) {
        int n; scanf ("%d", &n);

        int frq [100 + 10];
        Set (frq, 0);

        int num;

        for ( int i = 0; i < n; i++ ) {
            for ( int j = 0; j < n; j++ ) {
                scanf ("%d", &num);
                frq [num]++;
            }
        }

        bool ans = true;

        for ( int i = 0; i < 101; i++ ) {
            if ( frq [i] > n ) ans = false;
        }

        printf ("Case %d: ", ++cases);

        if ( ans ) printf ("yes\n");
        else printf ("no\n");

    }

	return 0;
}

// @END_OF_SOURCE_CODE