[백준/C++] 2755번 부녀회장이 될테야

문제 : www.acmicpc.net/problem/5622

<풀이>

#include <iostream>
using namespace std;

int apartM[15][14] ;

int findRoomMember(int floor, int room)
{
	if (floor==0||room==0) { return ++room; }
	else  { return findRoomMember(floor-1, room) + findRoomMember(floor, room-1); }
}

int main()
{
	int count, i; cin >> count;
	for (i = 0; i < count; i++)
	{
		int k, n; cin >> k >> n;
		cout << findRoomMember(k, n-1) << endl;
	}
	return 0;
}

<어떻게 풀었는가?>