不懂的太多了!
对于此题:
1. c [i] [j] = c [i-1] [j-1] + c [i-1] [j]
2. mod操作满足加法性质,即(a + b) mod c = ( (a mod c) + (b mod c) ) mod c
详见大神blog:http://hi.baidu.com/aekdycoin/item/e051d6616ce60294c5d249d7
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int c[1001][1001];
int main(){
int t,n,k;
int i,j;
scanf("%d",&t);
memset(c,0,sizeof(c));
for(i=1;i<=1000;i++)
c[i][1]=i;
for(i=2;i<=1001;i++)
for(j=2;j<=501;j++)
if(c[i][j]==0)
c[i][j]=(c[i-1][j-1]+c[i-1][j])%10000003; //所有组合先全部计算出来,之后直接取用,不然TLE
while(t--){
scanf("%d%d",&n,&k);
if(n==k||k==0){ //k==0的情况需要注意
printf("1\n");
continue;
}
else if(k>n-k) k=n-k;
printf("%d\n",c[n][k]);
}
return 0;
}
/**************************************
Problem id : SDUT OJ 2164
Result : Accepted
Take Memory : 4412K
Take Time : 20MS
Submit Time : 2013-05-26 14:32:51
**************************************/