Untitled
unknown
plain_text
5 years ago
467 B
6
Indexable
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
long long dp[23][23];
long long solve(int i, int j) {
if (i == 1 || j == 1)
return 1;
if (dp[i][j] != -1)
return dp[i][j];
return dp[i][j] = (solve(i - 1, j) + solve(i, j - 1));
}
signed main() {
int n, m;
scanf("%d%d", &n, &m);
n++;
m++;
if (n > 21 || m > 21)
return 3;
for (int i = 0; i < 23; ++i)
for (int j = 0; j < 23; ++j)
dp[i][j] = -1;
printf("%lld", solve(n, m));
}Editor is loading...