1878.cpp

来自「杭电 acm部分代码 有兴趣的可以下载 谢谢」· C++ 代码 · 共 50 行

#include <iostream>
#include <string>
using namespace std;
int m, n;
int hash[1001][1001];
int num[1001];
bool visit[1001];
void dfs(int a)
{
	int i;
	visit[a] = true;
	for (i = 1; i <= n; i++)
	{
		if(hash[a][i] == 1 && visit[i] == false)
		{
			dfs(i);
		}
	}
}
int main()
{
	int i, a, b, flag;
	while (cin >> n && n)
	{
		cin >> m;
		memset(hash, 0, sizeof(hash));
		memset(num, 0, sizeof(num));
		memset(visit, false, sizeof(visit));
		for (i = 1; i <= m; i++)
		{
			scanf("%d %d", &a, &b);
			hash[a][b] = 1;
			hash[b][a] = 1;
			num[a]++;
			num[b]++;
		}
		flag = 1;
		dfs(1);
		for (i = 1; i <= n; i++)
		{
			if (visit[i] == false || num[i] % 2 == 1)
			{
				flag = 0;
				break;
			}
		}
		cout << flag << endl;
	}
	return 0;
}