* Computer Science/C++
Combination & memset
soicem
2018. 4. 4. 14:07
memset 사용 및 조합 코드
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 | #include<iostream> #include<vector> using namespace std; int cache[30][30]; int bino(int n, int r) { if (r == 0 || n == r) return 1; if (cache[n][r] != -1) return cache[n][r]; return cache[n][r] = bino(n - 1, r - 1) + bino(n - 1, r); } int main() { int n, r; cin >> n; cin >> r; for (int i = 0; i < 30; i++) memset(cache[i], -1, sizeof(cache[0])); cout << bino(n, r) << endl; system("pause"); return 0; } | cs |