Cod sursa(job #2766541)
| Utilizator | Data | 2 august 2021 10:39:24 | |
|---|---|---|---|
| Problema | Sandokan | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <bits/stdc++.h>
#define MOD 2000003
using namespace std;
int n,k;
int dp[5003];
int main()
{
freopen("sandokan.in","r",stdin);
freopen("sandokan.out","w",stdout);
scanf("%d %d",&n,&k);
int aux = n;
while(aux >= k) {
aux -= (k-1);
}
n--;aux--;
int line = 1;
dp[0] = 1;
dp[1] = 1;
for(int i = 2; i <= n; i++) {
for(int j = i; j >= 1; j--) {
dp[j] += dp[j-1];
dp[j] %= MOD;
}
}
printf("%d",dp[aux]);
return 0;
}
