poj 3660
来源:互联网 发布:苹果越狱美化软件 编辑:程序博客网 时间:2024/06/18 06:41
Description
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 54 34 23 21 22 5
Sample Output
2
题解:如果1可以打败2,2可以打败3,那么1可以打败3,所以只要确定某一个数与其他n-1个之间的关系,可能是打败,也可能是被打败,就能确定他的名字。
#include<stdio.h>int map[105][105];void floya(int n) {int i, j, k;for(k = 1; k <= n; k++)for(i = 1; i <= n; i++)for(j = 1; j <= n; j++)if(map[i][k] && map[k][j])map[i][j] = 1;}int main() {int n, m;while (scanf("%d%d", &n, &m) != EOF) {int i, j;for(i = 1; i < 105; i++)for(j = 1; j < 105; j++)map[i][j] = 0;int count, win, down, sum = 0;for(i = 1; i <= m; i++) {scanf("%d%d", &win, &down);map[win][down] = 1;}floya(n);for(i = 1; i <= n; i++) {count = 0;for(j = 1; j <= n; j++) if(map[i][j] || map[j][i])count++;if(count == n - 1)sum++;}printf("%d\n", sum);}}
- poj 3660
- poj 3660
- poj 3660
- POJ 3660
- POJ 3660
- poj---3660
- POJ 3660
- poj 3660
- poj 3660
- POJ 3660
- POJ 3660
- poj 1125 , poj 3660 floyd
- poj 3660 Cow Contest
- POJ 3660 Cow Contest
- POJ 3660 floyd 算法
- POJ 3660 Cow Contest
- poj 3660 Cow Contest
- POJ-3660-Cow Contest
- 【BZOJ 1058】【ZJOI 2007】报表统计【Treap】
- PHP小笔记
- 运动框架-----改变任意的style值
- win10系统安装VM、ubuntu及ubuntu自适应桌面
- React-Native 热更新尝试(Android)
- poj 3660
- Problem G: 平面上的点和线——Point类、Line类 (III)
- C++练习:返回值指针or引用
- Hibernate-Session
- 线程类Thread详解和线程的几种状态,守护线程
- 搬瓦工的一键Shadowsocks Server(创建多用户)+wordpress改中文
- ZZL训练总结
- mybatis异常invalid comparison: java.util.Date and java.lang.String
- Android Studio中”Lambda表达式“使用方法及导入详解