Pagini recente » Borderou de evaluare (job #807788) | Cod sursa (job #1190510) | Cod sursa (job #2541677) | Cod sursa (job #475459) | Cod sursa (job #2838000)
#include <iostream>
#include <fstream>
#define MOD 2000003
using namespace std;
int n,k,p,c[5002],ant[5002];
ifstream fin("sandokan.in");
ofstream fout("sandokan.out");
int main()
{
fin >> n >> k;
p = (n-1)%(k-1)+1;
ant[0] = ant[1] = c[0] = 1;
/// schimbari:
/// - ant[j] = c[i-1][j]
/// - c[j] = c[i][j]
for(int i = 2; i <= n; i++){
/// determinam c
for(int j = 1; j <= i; j++){
c[j] = (ant[j]+ant[j-1])%MOD;
}
/// schimabm ant
for(int j = 1; j <= i; j++){
ant[j] = c[j];
}
}
fout << c[p-1] << "\n";
return 0;
}