Files
OI-source/history_source/信息学奥赛一本通/2.3.7.cpp
2023-08-03 09:22:52 +08:00

15 lines
215 B
C++

#include<cstdio>
int main()
{
int n,m;
scanf("%d%d",&m,&n);
int map[n];
for(int i=0;i<n;i++) map[i]=1;
for(int i=2;i<=m;i++)
for(int j=1;j<n;j++)
map[j]+=map[j-1];
printf("%d\n",map[n-1]);
return 0;
}