The second ACM College Student Program Design competition in Shandong province D

Number of combinations:

AC Code:

#include <iostream>#include<cstdio>#include<cstring>using namespacestd;intc[1010][1010];intMain () {intT, N, K;  for(inti =0; I <1001; i++) c[i][0] =1;  for(inti =1; I <1001; i++)    {         for(intj =1; J <1001; J + +) {C[i][j]= (C[i-1][j-1] + c[i-1][J])%10000003; }} scanf ("%d", &t);  while(t--) {scanf ("%d%d", &n, &k); printf ("%d\n", C[n][k]); }    return 0;}/************************************** problem id:sdut OJ D User name:xam140325 Choru Result: Accepted take memory:4464k take time:20ms Submit time:2016-05-02 15:01:57 ******************* *******************/

The second ACM College Student Program Design competition in Shandong province D