Ubiquitous Religions
来源:互联网 发布:单片机驱动有源蜂鸣器 编辑:程序博客网 时间:2024/06/05 16:02
Ubiquitous Religions
Time Limit: 1000MS Memory limit: 65536K
题目描述
There are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out how many different religions students in your university believe in.
You know that there are n students in your university (0 < n <= 50000). It is infeasible for you to ask every student their religious beliefs. Furthermore, many students are not comfortable expressing their beliefs. One way to avoid these problems is to ask m (0 <= m <= n(n-1)/2) pairs of students and ask them whether they believe in the same religion (e.g. they may know if they both attend the same church). From this data, you may not know what each person believes in, but you can get an idea of the upper bound of how many different religions can be possibly represented on campus. You may assume that each student subscribes to at most one religion.
输入
The input consists of a number of cases. Each case starts with a line specifying the integers n and m. The next m lines each consists of two integers i and j, specifying that students i and j believe in the same religion. The students are numbered 1 to n. The end of input is specified by a line in which n = m = 0.
输出
For each test case, print on a single line the case number (starting with 1) followed by the maximum number of different religions that the students in the university believe in.
示例输入
10 91 21 31 41 51 61 71 81 91 1010 42 34 54 85 80 0
示例输出
Case 1: 1Case 2: 7
#include <stdio.h>#include <stdlib.h>int f[100001];int find(int x){ int i,j,r; r=x; while(r!=f[r]) r=f[r]; i=x; while(i!=r) { j=f[i]; f[i]=r; i=j; } return r;}void merge(int x,int y){ int fx,fy; fx=find(x); fy=find(y); if(fx!=fy) f[fx]=fy;}int main(){ int n,m,a,b,c,i,s=1; while(~scanf("%d%d",&n,&m)) { if(m==0&&n==0)break; c=0; for(i=1;i<=n;i++) f[i]=i; while(m--) { scanf("%d%d",&a,&b); merge(a,b); } for(i=1;i<=n;i++) if(f[i]==i)c++; printf("Case %d: %d\n",s++,c); } return 0;}
0 0
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Step6.1.1 1102Constructing Roads(克鲁斯卡尔)
- sqlserver存储过程验证用户登录和账号是否停用或者被其他人登录中--写给新人
- DOS命令及批处理脚本杂记
- Linux系统调用函数
- 历届试题 带分数
- Ubiquitous Religions
- (汇)MyEclipse10.7终极技巧汇总(持续更新)
- C++中重载,重写(覆盖),隐藏 与 多态性
- MySQL学习笔记_7_MySQL常用内置函数
- 最近招聘面试的一些感悟
- GitHub导入Maven项目到Eclipse
- 历届试题 剪格子
- 个性二维码,三分钟搞定,愤怒的小鸟!
- 將ping命令執行結果保存在文檔