http://acm.hdu.edu.cn/showproblem.php?pid=1863
//Problem : 1863 ( 畅通工程 ) Judge Status : Accepted
//RunId : 19221043 Language : G++ Author : 311309030328
//Code Render Status : Rendered By HDOJ G++ Code Render Version 0.01 Beta
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=110;
int pre[MAXN];
struct node
{
int u,v,val;
}edge[MAXN];//结构体数组
int cmp(node x, node y)
{
return x.val<y.val;//升序
}
int find(int x)
{
if(pre[x]==x)
{
return x;
}
return pre[x]=find(pre[x]);
}
int main()
{
int m,n;
while(~scanf("%d%d",&m,&n),m)
{
int i,j,a,b,c;
//memeset(pre,0,sizoef(pre))
for(i=1;i<=n;i++)
{
pre[i]