백준/백준-C++

2775번: 부녀회장이 될테야

Beabletoet 2017. 1. 28. 18:51

#include <iostream>

#include <string.h>

using namespace std;

int main()

{

int T, k, n, room[15][15];

memset(room, 0, sizeof(room));

for (int i = 0; i < 15; ++i)

{

room[0][i] = i;

room[i][1] = 1;

}

for (int i = 1; i < 15; ++i)

for (int j = 1; j < 15; ++j)

room[i][j] = room[i][j - 1] + room[i - 1][j];

cin >> T;

for (int i = 0; i < T; ++i)

{

cin >> k >> n;

cout << room[k][n] << endl;

}

}



--아래는 계산을 매 행마다 세면서 해주는 식으로 c언어코딩


#include <stdio.h>

#include <string.h>


int main()

{

int T, k, n, room[15][15];

memset(room, 0, sizeof(room));

for (int i = 1; i < 15; ++i)

room[0][i] = i;

for (int i = 1, person; i < 15; ++i)

{

person = 0;

for (int j = 1; j < 15; ++j)

{

person += room[i - 1][j];

room[i][j] = person;

}

}

scanf("%d", &T);

while (T > 0)

{

scanf("%d %d", &k, &n);

printf("%d\n", room[k][n]);

--T;

}

}