Cod sursa(job #2910197)
Utilizator | Data | 18 iunie 2022 18:28:41 | |
---|---|---|---|
Problema | Sandokan | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
#define MOD 2000003
#define LEN_MAX 5000
using namespace std;
int main()
{
ifstream fin("sandokan.in");
ofstream fout("sandokan.out");
unsigned fact[LEN_MAX] = { 0 }, N, K, i, j;
fin >> N >> K;
fact[0] = fact[1] = 1;
for (i = 2; i < N; ++i)
for (j = i; j >= 1; --j)
fact[j] = (fact[j] + fact[j - 1]) % MOD;
fout << fact[(N - 1) % (K - 1)];
fin.close(); fout.close();
return 0;
}