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
[分析]
floyd判断传递闭包
i和k有关系并且k和j有关系,那么i和j有关系 那么ij有关系
最后判断某个和其他所有是否有关系
则ans++;
[代码]
#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
#include<cstring>
using namespace std;
#define INF 0x3f3f3f3f
int a[105][105];
void floyd(int n)
{
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (a[i][k] && a[k][j])
a[i][j] = 1;
}
int main()
{
int n, m;
while (scanf("%d%d", &n, &m) != EOF)
{
memset(a, 0, sizeof(a));
for (int i = 0; i < m; i++)
{
int x, y;
scanf("%d%d", &x, &y);
a[x][y] = 1;
}
floyd(n);
int ans = 0;
for (int i = 1; i <= n; i++)
{
int flag = 1;
for (int j = 1; j <= n; j++)
{
if (i == j)continue;
if (a[i][j] == 0 && a[j][i] == 0)flag = 0;
}
if (flag)ans++;
}
printf("%d\n", ans);
}
}