Pagini recente » Cod sursa (job #2390171) | Cod sursa (job #2282055) | Cod sursa (job #3136664) | Cod sursa (job #885236) | Cod sursa (job #2840889)
#include <fstream>
using namespace std;
int ant[5010], crt[5010];
int main() {
ifstream fin("sandokan.in");
ofstream fout("sandokan.out");
int n, k;
fin >> n >> k;
int m = n;
while (m >= k) {
m -= (k - 1);
}
ant[0] = ant[1] = crt[0] = 1;
for (int i = 2; i <= n - 1; i++) {
for (int j = 1; j <= i; j++) {
crt[j] = (ant[j] + ant[j - 1]) % 2000003;
}
for (int j = 1; j <= i; j++) {
ant[j] = crt[j];
}
}
fout << crt[m - 1];
return 0;
}