#include <stdio.h>
int bin[50010];int findx(int x)
{
int r=x;
while(r!=bin[r])
r=bin[r];
int j=x;
int k;
while(bin[j]!=r)
{
k=bin[j];
bin[j]=r;
j=k;
}
return r;
}void merge(int x,int y)
{
int fx,fy;
fx = findx(x);
fy = findx(y);
if(fx != fy)
bin[fx] = fy;
}int main()
{
int n,m,x,j,y,i,k=0,count;
bin[0]=0;
while(scanf("%d%d",&n,&m)!=EOF&&(n||m))
{
for(i=1;i<=n;i++)
bin[i]=i;
for(j=m;j>0;j--)
{
scanf("%d %d",&x,&y);
merge(x,y);
}
for(count=0,i=1;i<=n;i++)
if(bin[i] == i)
count ++;
k++;
printf("Case %d: %d\n",k,count); }
return 0;
}#include <stdio.h>
int bin[50010];int findx(int x)
{
int r=x;
while(r!=bin[r])
r=bin[r];
int j=x;
int k;
while(bin[j]!=r)
{
k=bin[j];
bin[j]=r;
j=k;
}
return r;
}void merge(int x,int y)
{
int fx,fy;
fx = findx(x);
fy = findx(y);
if(fx != fy)
bin[fx] = fy;
}int main()
{
int n,m,x,j,y,i,k=0,count;
bin[0]=0;
while(scanf("%d%d",&n,&m)!=EOF&&(n||m))
{
for(i=1;i<=n;i++)
bin[i]=i;
for(j=m;j>0;j--)
{
scanf("%d %d",&x,&y);
merge(x,y);
}
for(count=0,i=1;i<=n;i++)
if(bin[i] == i)
count ++;
k++;
printf("Case %d: %d\n",k,count); }
return 0;
}
- 1.
- 2.
- 3.
- 4.
- 5.
- 6.
- 7.
- 8.
- 9.
- 10.
- 11.
- 12.
- 13.
- 14.
- 15.
- 16.
- 17.
- 18.
- 19.
- 20.
- 21.
- 22.
- 23.
- 24.
- 25.
- 26.
- 27.
- 28.
- 29.
- 30.
- 31.
- 32.
- 33.
- 34.
- 35.
- 36.
- 37.
- 38.
- 39.
- 40.
- 41.
- 42.
- 43.
- 44.
- 45.
- 46.
- 47.
- 48.
- 49.
- 50.
- 51.
- 52.
- 53.
- 54.
- 55.
- 56.
- 57.
- 58.
- 59.
- 60.
- 61.
- 62.
- 63.
- 64.
- 65.
- 66.
- 67.
- 68.
- 69.
- 70.
- 71.
- 72.
- 73.
- 74.
- 75.
- 76.
- 77.
- 78.
- 79.
- 80.
- 81.
- 82.
- 83.