Pagini recente » Cod sursa (job #861869) | Cod sursa (job #3127951) | Cod sursa (job #1049123) | Cod sursa (job #391844) | Cod sursa (job #2904958)
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <unordered_map>
#define NMAX 5003
#define MOD 2000003
using namespace std;
ifstream fin("sandokan.in");
ofstream fout("sandokan.out");
int n, k;
int comb[NMAX][NMAX];
int main()
{
fin >> n >> k;
int m = n;
while (m >= k)
{
m = m - k + 1;
}
//calculez comb de n luate cate m
comb[1][1] = 1;
comb[1][0] = 1;
for (int i = 2; i <= n; i++)
{
comb[i][0] = 1;
for (int j = 1; j <= i; j++)
{
comb[i][j] = comb[i - 1][j] + comb[i - 1][j - 1];
comb[i][j] %= MOD;
}
comb[i][i] = 1;
}
fout << comb[n][m-1];
return 0;
}