标签:
Description
Input
Output
Sample Input
2
1 3
2 3
Sample Output
3
3
//尴尬,这题没找出规律,,,就是你画个 m,n 的二维的表,就很容易看出规律了
1 #include <stdio.h> 2 #define MAXN 2005 3 4 int d[MAXN][MAXN]; 5 6 void count() 7 { 8 int i, j; 9 for(i = 1; i < MAXN; ++i) 10 d[i][1] = i % 1007; 11 12 for(i = 1; i < MAXN; ++i) 13 for(j = 2; j < MAXN; ++j) 14 d[i][j] = (d[i-1][j] + d[i-1][j-1]) % 1007; 15 } 16 17 int main() 18 { 19 int n, m, t; 20 count(); 21 scanf("%d", &t); 22 while(t--) 23 { 24 scanf("%d%d", &m, &n); 25 printf("%d\n", d[n][m]); 26 } 27 return 0; 28 }
标签:
原文地址:http://www.cnblogs.com/haoabcd2010/p/5742643.html