비밀지도

https://programmers.co.kr/learn/courses/30/lessons/17681

string Tobinary(int n)
{
	string sTemp="";
	while (n > 0)
	{
		sTemp = to_string(n%2)+sTemp ;
		n /= 2;
	}
	return sTemp;
}

vector<string> solution(int n, vector<int> arr1, vector<int> arr2) {
	vector<string> answer;

	vector<string> vTemp1;
	vector<string> vTemp2;

	for (int i = 0; i < arr1.size(); i++)
	{
		string sTemp1 = Tobinary(arr1[i]);
		if (sTemp1.size() != n)
		{
			while (sTemp1.size() != n)
			{
				sTemp1 = "0" + sTemp1;
			}
		}
		vTemp1.emplace_back(sTemp1);

		string sTemp2 = Tobinary(arr2[i]);
		if (sTemp2.size() != n)
		{
			while (sTemp2.size() != n)
			{
				sTemp2 = "0" + sTemp2;
			}
		}
		vTemp2.emplace_back(sTemp2);
	}

	for (int i = 0; i < n; i++)
	{
		string sTemp = "";
		for (int j = 0; j < n; j++)
		{
			if (vTemp1[i][j] == '0' && vTemp2[i][j] == '0')
			{
				sTemp = sTemp+" ";
			}
			else
			{
				sTemp = sTemp+"#" ;
			}
		}
		answer.emplace_back(sTemp);
	}

	return answer;
}

이문제는
1. 진법변환해서 string처리하기 / string 처리후 합성
2. 2차원 벡터다루기 문제유형이다.