Pagini recente » Cod sursa (job #3225828) | Cod sursa (job #315769) | Cod sursa (job #1948247) | Cod sursa (job #379150) | Cod sursa (job #174727)
Cod sursa(job #174727)
#include <cstdio>
#include <vector>
#define mod 2000003
using namespace std;
vector <int> v,f;
int n,k,p;
void citire()
{
freopen("sandokan.in","r",stdin);
scanf("%d%d", &n, &k);
int w;
for (int i=0; i<n; i++)
{
scanf("%d", &w);
v.push_back(w);
}
}
void sandokan()
{
//sort(q.begin(),q.end());
p=n%(k-1);
f.push_back(1);
f.push_back(1);
for (int i=2; i<n; i++)
{
int w=f[i-1]*i;
f.push_back(w);
}
int rez=(f[n-1])/(f[n-p]%mod)*(f[p-1]%mod);
rez%=mod;
freopen("sandokan.out","w",stdout);
printf("%d",rez);
}
int main()
{
citire();
sandokan();
return 0;
}