pku1975.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>
#include <string.h>
#define size 101
int l[size][size], h[size][size];

void Solve()
{
	int N, m;
	int i, j, s, e, k, ans;
	memset(l, 0, sizeof(l));
	memset(h, 0, sizeof(h));
	scanf("%d %d", &N, &m);
	while (m--)
	{
		scanf("%d %d", &s, &e);
		s--;
		e--;
		l[s][e] = 1;
		h[e][s] = 1;
	}
	for (k = 0; k < N; k++)
	{
		for (i = 0; i < N; i++)
		{
			for (j = 0; j < N; j++)
			{
				l[i][j] = l[i][j] || (l[i][k] && l[k][j]);
				h[i][j] = h[i][j] || (h[i][k] && h[k][j]);
			}
		}
	}
	ans = 0;
	for (i = 0; i < N; i++)
	{
		s = 0;
		e = 0;
		for (j = 0; j < N; j++)
		{
			s += l[i][j];
			e += h[i][j];
		}
		if (s * 2 > N || e * 2 > N)
		{
			ans++;
		}
	}
	printf("%d\n", ans);
}

int main()
{
	int t;
	scanf("%d", &t);
	while (t--)
	{
		Solve();
	}
	return 0;
}