洛谷-Cow Gymnastics B

#include <bits/stdc++.h>
using namespace std;
int k, n, sum;
int a[9999][9999];
int jilu[9999][9999];//存储判断

int main () 
{
	cin >> k >> n;
	for (int i = 1; i <= k; i++) 
	{
		for (int j = 1; j <= n; j++) 
		{
			cin >> a[i][j];
		}
	}
	for (int i = 1; i <= k; i++) 
	{
		for (int j = 1; j <= n; j++) 
		{
			for (int g = j + 1; g <= n; g++) 
			{
				jilu[a[i][j]][a[i][g]]++;//如果这个储存数组到达就说明一直
			}//通过序号储存对比的结果。
		}//用数组储存数据。
	}
	int la = max(k, n);
	for (int i = 1; i <= la; i++) 
	{
		for (int j = 1; j <= la; j++) 
		{
			if (jilu[i][j] == k)
				sum++;
		}
	}
	cout << sum;
	return 0;
}