H - Cow Contest

N (1 ≤ N ≤ 100) cows, conveniently numbered 1…N, are participating in a programming contest. As we all know, some cows code better than others. Each cow has a certain constant skill rating that is unique among the competitors.

The contest is conducted in several head-to-head rounds, each between two cows. If cow A has a greater skill level than cow B (1 ≤ A ≤ N; 1 ≤ B ≤ N; A ≠ B), then cow A will always beat cow B.

Farmer John is trying to rank the cows by skill level. Given a list the results of M (1 ≤ M ≤ 4,500) two-cow rounds, determine the number of cows whose ranks can be precisely determined from the results. It is guaranteed that the results of the rounds will not be contradictory.

Input

• Line 1: Two space-separated integers: N and M
• Lines 2…M+1: Each line contains two space-separated integers that describe the competitors and results (the first integer, A, is the winner) of a single round of competition: A and B

Output

• Line 1: A single integer representing the number of cows whose ranks can be determined

Sample Input
5 5
4 3
4 2
3 2
1 2
2 5
Sample Output
2

传递闭包
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int a[101][101];
int main()
{
    int i,j,n,m,x,y,k,sum;
    scanf("%d %d",&n,&m);
    memset(a,0,sizeof(a));
    for(i=1;i<=m;i++)
    {
        scanf("%d %d",&x,&y);
        a[x][y]=1;//x能战胜y
    }
    for(k=1;k<=n;k++)
    {
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++)
            {
                if(a[i][k]&&a[k][j])//做出传递矩阵
                    a[i][j]=1;
            }
        }
    }
    int ans=0;
    for(i=1;i<=n;i++)
    {
        sum=0;
        for(j=1;j<=n;j++)
        {
            sum+=a[i][j]+a[j][i];//j能战胜或被战胜
        }
        if(sum==n-1)
            ans++;
    }
    printf("%d\n",ans);
    return 0;
}