Cod sursa(job #3375589)
| Utilizator | Data | 12 noiembrie 2026 15:56:10 | |
|---|---|---|---|
| Problema | Sandokan | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <bits/stdc++.h>
#define MOD 2000003
using namespace std;
ifstream fin("sandokan.in");
ofstream fout("sandokan.out");
long long n,m,i,j,k;
int v[5005],fact[5005];
int Pow(int b, int e){
int p=1;
while(e){
if(e%2)
p = 1LL*p*b%MOD;
b = 1LL*b*b%MOD;
e /= 2;
}
return p;
}
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>v[i];
fact[0] = 1;
for(i=1;i<=n;i++)
fact[i] = 1LL * fact[i-1] * i % MOD;
m = (n-k)%(k-1)+1;
fout<<1LL*fact[n-1]*Pow(fact[n-m], MOD-2)%MOD;
return 0;
}
