（DP）51NOD 1118 机器人走方格

 1 #include <stdio.h>
 2 
 3 #define MOD ((int)1e9+7)
 4 
 5 int dp[1005] = {1};
 6 
 7 int main()
 8 {
 9     int m, n;
10     while (scanf_s("%d%d", &m, &n) != EOF)
11     {
12         for (int i = 0; i < m; i++)
13         {
14             for (int j = 1; j < n; j++)
15             {
16                 dp[j] = (dp[j - 1] + dp[j]) % MOD;
17             }
18         }
19         printf("%d\n", dp[n - 1]);
20     }
21 }