POJ 3660 Floyd 传递闭包

//Floyd 传递闭包 模板题
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxv=110;
bool mmap[maxv][maxv];
int main(void) {
#ifndef ONLINE_JUDGE
    freopen("E:\\input.txt","r",stdin);
#endif // ONLINE_JUDGE
    ios::sync_with_stdio(false);
    int n,m;
    cin>>n>>m;
    memset(mmap,false,sizeof mmap);
    for(int i=1;i<=m;i++){
        int x,y;
        cin>>x>>y;
        mmap[x][y]=true;
    }
    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
                mmap[i][j] |= mmap[i][k] & mmap[k][j];
    int ans=0;
    for(int i=1;i<=n;i++){
        int cnt=0;
        for(int j=1;j<=n;j++){
            if(mmap[i][j])
                cnt++;
            if(mmap[j][i])
                cnt++;
        }
        if(cnt==n-1)
            ans++;
    }
    cout<<ans<<endl;

    return 0;
}