본문 바로가기
Computer Science/Algorithm

[종만북] 소풍(PICNIC) - 미완

by 수제햄버거 2020. 12. 29.
728x90
반응형
#include <iostream>

using namespace std;
bool areFriends[10][10];
int n;

int countPairings(bool taken[10])
{
	//cout << "함수호출 " << endl;

	//for (int i =0;i<n;i++)
	//{
	//	cout << taken[i] << " ";
	//}
	//cout << endl;

	int firstFree = -1;
	for (int i = 0; i < n; ++i)
	{
		if (!taken[i])
		{
			firstFree = i;
			break;
		}
	}

	if (firstFree == -1)
	{
		//cout << "+1" << endl;
		return 1;
	}
	int ret = 0;
	for (int pairWith = firstFree + 1; pairWith < n ; ++pairWith)
	{
		/*cout << "pairWitht "<<pairWith << endl;
		cout << "firsFree " << firstFree << endl; 
		cout << taken[pairWith] << " " << areFriends[firstFree][pairWith] << endl;*/
		if (!taken[pairWith] && areFriends[firstFree][pairWith])
		{
			taken[firstFree] = taken[pairWith] = true;
			/*for (int i = 0; i < n; i++)
			{
				cout << taken[i] << " ";
			}
			cout << endl; */
			ret += countPairings(taken);
			taken[firstFree] = taken[pairWith] = false;
			/*for (int i = 0; i < n; i++)
			{
				cout << taken[i] << " ";
			}
			cout << endl;*/
		}
	}

	return ret;
}

int main()
{
	int test_case = 0;
	int m;
	int temp1,temp2;
	int ans = 0;
	bool taken[10] = { 0,0,0,0,0,0,0,0,0,0 };
	cin >> test_case;
	for (int tmp = 0; tmp < test_case; tmp++)
	{
		n = m = 0;
		for (int k = 0; k < n; k++)
		{
			taken[k] = 0;
		}

		for (int k = 0; k < 10; k++)
		{
			for (int k2 = 0; k < 10; k++)
			{
				areFriends[k][k2] = false;
			}
		}
		cin >> n >> m;
		for (int i = 0; i < m; i++)
		{
			cin >> temp1>>temp2;
			if (areFriends[temp1][temp2] == false) 
			{
				areFriends[temp1][temp2] = true;
				if (areFriends[temp2][temp1] == false)
				{
					areFriends[temp2][temp1] = true;
				}
			}
		}
		ans = countPairings(taken);
		cout << "Answer is " << countPairings(taken) << endl;
		
	}
	return 0;
}

왜 마지막 답이 5가 나오는지 모르겠음 초기화를 잘못햇나

반응형