[코딩테스트] 카펫

문제

---

풀이

#include <string>
#include <vector>
#include <algorithm>
#include <iostream>

using namespace std;


vector<int> solution(int brown, int yellow) {

	vector<int> answer;

	int sum = brown + yellow;

	for (int i = 1; i <= brown * 0.5f; i++)
	{
		for (int j = 1; j <= brown * 0.5f; j++)
		{
			if (i * j == sum && (i - 2) * (j - 2) == yellow)
			{
				answer.emplace_back(j);
				answer.emplace_back(i);

				return answer;
			}
		}
	}

	return answer;
}