Cod sursa(job #1379051)
Utilizator | Data | 6 martie 2015 15:59:59 | |
---|---|---|---|
Problema | Sandokan | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
#define NMax 5010
#define MOD 2000003
using namespace std;
ifstream f("sandokan.in");
ofstream g("sandokan.out");
int n, k, tmp, comb[NMax];
int main()
{
f >> n >> k;
int tmp = n;
while (n >= k)
n -= (k - 1);
k = n - 1;
n = tmp - 1;
comb[0] = 1;
for (int i = 1; i <= n; i++)
for (int j = i; j >= 1; j--)
comb[j] = (comb[j] + comb[j - 1]) % MOD;
g << comb[k] % MOD;
}