南阳理工 211 Cow Contest

Cow Contest

时间限制： 1000 ms  |  内存限制： 65535 KB

难度： 4

描述

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.

输入

* 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

There are multi test cases.The input is terminated by two zeros.The number of test cases is no more than 20.

输出

For every case:
* Line 1: A single integer representing the number of cows whose ranks can be determined

样例输入

5 5
4 3
4 2
3 2
1 2
2 5
0 0

样例输出

2

package acm.ny;

import java.util.Scanner;

public class Ny0211_20130502_2022 {
	private static boolean[][] map;
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int n, m, a, b;
		n = in.nextInt();
		m = in.nextInt();
		while (m != 0 || n != 0) {
			map = new boolean[n][n];
			for (int i = 0; i < m; ++i) {
				a = in.nextInt();
				b = in.nextInt();
				map[a - 1][b - 1] = true;
			}
			for (int k = 0; k < n; ++k) {
				for (int i = 0; i < n; ++i) {
					for (int j = 0; j < n; ++j) {
						if (map[i][k] && map[k][j]) {
							map[i][j] = true;
						}
					}
				}
			}
			int ant = 0, temp = 0;
			for (int i = 0; i < n; ++i) {
				temp = 0;
				for (int j = 0; j < n; ++j) {
					if (map[i][j] || map[j][i]) {
						++temp;
					}
				}
				if (temp == n - 1) {
					++ant;
				}
			}
			System.out.println(ant);
			n = in.nextInt();
			m = in.nextInt();
		}
		in.close();
	}
}