Cod sursa(job #3373021)
| Utilizator | Data | 5 noiembrie 2026 21:34:59 | |
|---|---|---|---|
| Problema | Sandokan | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("sandokan.in");
ofstream g("sandokan.out");
const int MOD = 2000003;
int c[5001];
int main()
{
int n, k, x;
f >> n >> k;
for(int i = 1; i <= n; i++)
f >> x;
int r = (n - 1) % (k - 1) + 1; // nr elem ramase
int top = n - 1, sel = r - 1; // Comb(top, sel)
c[0] = 1;
for (int i = 1; i <= top; i++)
for (int j = min(i, sel); j >= 1; j--)
c[j] = (c[j] + c[j - 1]) % MOD;
g << c[sel];
return 0;
}
