2182459_ac_312ms_3984k.cpp

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>
# include <string.h>

void input()
{
	int i, j, p;
	int N, M, T, K;
	int e, w;
	int sub[1001][1001];
	int cross[1001];

	scanf("%d",&T);
	for(i = 1; i <= T; i++)
	{
		scanf("%d%d%d",&N,&M,&K);
		printf("Test case %d: ",i);
		memset(sub,0,sizeof(sub));
		memset(cross,0,sizeof(cross));
		for(j = 0; j < K; j++)
		{
			scanf("%d%d",&e,&w);
			sub[e-1][w-1] = 1;
		}
		__int64 ans = 0;
		for(j = 0; j < N; j++)
		{
			__int64 tmp = 0;
			for(p = 0; p < M; p++)
			{
				ans += tmp * cross[p];
				if(sub[j][p])
				{
					tmp++;
					cross[p]++;
				}
			}
		}
		printf("%I64d\n",ans);
	}
}

int main()
{
	input();
	return 1;
}