Pagini recente » Cod sursa (job #3298173) | Cod sursa (job #1564792) | Cod sursa (job #2166551) | Cod sursa (job #1268791) | Cod sursa (job #2343463)
#include <fstream>
#include <algorithm>
using namespace std;
const int DIM = 50010;
int n, k;
int v[DIM];
int main()
{
ifstream fin("sandokan.in");
ofstream fout("sandokan.out");
fin>>n>>k;
if(k>n)
{
fout<<1;
return 0;
}
n--;
k--;
k=n%k;
v[0]=1;v[1]=1;
for(int i=2;i<=n;i++){
for(int j=i;j>=1;j--)
v[j]=(v[j]+v[j-1])%2000003;
}
fout<<v[k];
return 0;
}