## Solución al problema número 10583 de UVA - 10583.

Cualquier duda no dudes en contactar.

``````#include <bits/stdc++.h>
#define INF 0x3F3F3F3F
using namespace std;

const int MAXN = 50005;

struct edge{
int from, to, weight;
edge(){}
edge(int a, int b, int c){
from = a;
to = b;
weight = c;
}
bool operator<(const edge &other)const{ // sobrecarga de operadores para ordenar
return weight < other.weight;
}
};

struct UF{
int parents[MAXN];
int sz[MAXN];
int components;
int mst_sum;
UF(int n){
for(int i=0;i<n;i++){
parents[i] = i; sz[i] = 1;
}
components = n;
mst_sum = 0;
}
int find(int n){
return n == parents[n] ? n : find(parents[n]);
}
bool isConnected(int a, int b){
return find(a) == find(b);
}
void connect(int a, int b, int weight){
if(isConnected(a, b)) return;
int A,B; A = find(a); B = find(b);
if(sz[A] > sz[B]){
parents[B] = A;
sz[A] += sz[B];
}
else{
parents[A] = B;
sz[B] += sz[A];
}
mst_sum += weight;
components--;
}
};

int main(){
int N,E,c=1;
while(scanf("%d %d",&N,&E)==2 && (N!=0||E!=0))
{
vector<edge> edges;
UF uf = UF(N);
for(int i=0; i<E;i++)
{
int from,to; scanf("%d %d",&from,&to);
from--; to--;
edges.push_back(edge(from,to,1));
}
sort(edges.begin(), edges.end());
for(int i=0;i<E;i++) uf.connect(edges[i].from, edges[i].to, edges[i].weight);
printf("Case %d: %d\n",c++,uf.components);
}
return 0;
}
``````