Pagini recente » Cod sursa (job #1748630) | Cod sursa (job #2414199) | Cod sursa (job #1769959) | Cod sursa (job #19737) | Cod sursa (job #1338848)
#include<cstdio>
#define Mod 2000003
#define NMAX 5007
using namespace std;
int n, k, Ans[NMAX];
int main(){
freopen("sandokan.in", "r", stdin);
freopen("sandokan.out", "w", stdout);
scanf("%d %d", &n, &k);
int p = n % (k - 1);
if(p == 0)
p = k - 1;
--p;
Ans[0] = 1;
for(int i = 1; i <= n - 1; ++i)
for(int j = i; j >= 1; --j)
Ans[j] = (Ans[j - 1] + Ans[j]) % Mod;
printf("%d\n", Ans[p]);
return 0;
}