hdu1878判断欧拉图

/*判断是否有欧拉回路，即判断是否为欧拉图
条件1:图连通:用并查集判断
2：不含奇度顶点
*/

#include <cstdio>
#include <cstring>
#define N 1000

using namespace std;

int map[N][N];
int n, m;

int f[N];

void init()
{
	for (int i = 1; i <= n; i++)
		f[i] = i;
}

int find(int x)
{
	return x == f[x] ? x : f[x] = find(f[x]);
}

void merge(int x, int y)
{
	int t1, t2;
	t1 = find(x); t2 = find(y);
	if (t1 != t2)	f[t2] = t1;
	else return;
}

int main()
{
	while (scanf("%d", &n) != EOF && n)
	{
		init();
		scanf("%d", &m);
		int t1, t2;
		memset(map, 0, sizeof(map));
		for (int i = 0; i < m; i++)
		{
			scanf("%d%d", &t1, &t2);
			//输入有t1，t2相等的情况
			if (t1 == t2)
				continue;
			map[t1][t2] = map[t2][t1] = 1;
			merge(t1, t2);
		}
		
		int cnt = 0, flag1 = 0;//flag1用来标记是否连通
		for (int i = 1; i <&#