김씨만 행복한 세상

#include <iostream>
#include <algorithm>
using namespace std;
int Answer;
int main(int argc, char** argv)
{
	int T, test_case, n, m, p[201], a, b;
	cin >> T;
	for (test_case = 0; test_case < T; test_case++)
	{
		Answer = 1;
		cin >> n >> m;
		fill_n(&p[0], n+1, 0);
		for (int i = 0; i < m; ++i)
		{
			cin >> a >> b;
			if (p[a] == 0 && p[b] == 0)
			{
				p[a] = 1;
				p[b] = 2;
			}
			else if (p[a] == 0 || p[b] == 0)
				if (p[a] != 0)
					p[b] = (p[a] == 1) ? 2 : 1;
				else
					p[a] = (p[b] == 1) ? 2 : 1;
			else if(p[a] == p[b])
				Answer = 0;
		}
		cout << "Case #" << test_case + 1 << endl;
		cout << Answer << endl;
	}
	return 0;
}