runtah: UVa 12036 Stable Grid

Saturday, October 1, 2016

UVa 12036 Stable Grid

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
 int n, i, j, t, tst, kase=1;

 scanf("%d",&tst);

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

 int count[200]={0};
 bool valid = true;
 for (i=1 ; i<=n ; i++)
 {
 for (j=1 ; j<=n ; j++)
 {
 scanf("%d",&t);
 count[t]++;
 if (count[t]>n)
 {
 valid=false;
 }
 }
 }
 if (valid) printf("Case %d: yes ",kase++);
 else printf("Case %d: no ",kase++);

 }
 return 0;
}

Go to link download