Stable Grid

Consider a grid of size n x n where each cell contains a number. Let's call a grid stable if we can rearrange the numbers of each row so that every column of the resulting grid has no repeated values.

Mathematically, say, we have a grid G of size n x n. We would like to permute the elements of each row G_i ( 1in) so that the resulting grid has the following property:

For every column j, the values G_{i, j} are all distinct for ( 1in).

As an example, consider a grid G of size 4 x 4 as shown below

We can permute each row to get G' as shown below

In G', there are no repeated values in any column. So, the given grid is stable.

In this problem, you will be given a grid of size n x n and you have to determine whether it is stable or not.

Input 

500

Each case starts with a line containing the value of n ( 0 < n < 100). The next n lines contain n integers each. The j-th integer of the i-th line represent the value of G_{i, j}. Consecutive integers in each line are separated with space characters. All the integers in the grid are non-negative with magnitude not greater than 100.

Output 

Sample Input 

3
4
2 1 1 3
3 1 2 6
2 6 10 3
9 8 7 6
3
1 1 2
1 1 1
2 2 2
3
1 2 3
2 3 1
3 1 2

Sample Output 

Case 1: yes
Case 2: no
Case 3: yes

#include <stdio.h>
int main() {
	int t, n, x, Case = 0;
	scanf("%d", &t);
	while(t--) {
		scanf("%d", &n);
		int count[101] = {};
		int i, j, flag = 1;
		for(i = 0; i < n; i++) {
			for(j = 0; j < n; j++) {
				scanf("%d", &x);
				count[x]++;
				if(count[x] > n)
					flag = 0;
			}
		}
		printf("Case %d: ", ++Case);
		if(flag == 1)	puts("yes");
		else			puts("no");
	}
    return 0;
}