并查集-易爆物P191

#include<cstdio>
#include<iostream>
#include<vector>
#include<map>
using namespace std;

int p[200];

int findset(int x)
{
	return p[x]!=x?p[x]=findset(p[x]):x;//并查集 
}

int main()
{
	int x,y;
	int result=0;
	while(cin>>x)
	{
		for(int i=0;i<=1000;i++)
			p[i]=i;
		while(x!=-1)
		{
			scanf("%d",&y);
			x=findset(x);
			y=findset(y);
			if(x==y)
				++result;
			else
				p[x]=y;
			scanf("%d",&x);
		}
		cout<<result;
	}
	return 0;
}