Pagini recente » Cod sursa (job #797745) | Cod sursa (job #2529680) | Cod sursa (job #963864) | Cod sursa (job #2019339) | Cod sursa (job #174736)
Cod sursa(job #174736)
#include <cstdio>
#include <vector>
#define mod 2000003
using namespace std;
vector <int> v;
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);
long long a,b,c;
a=b=c=1;
long long w=1;
for (int i=2; i<n; i++)
{
w*=i;
if (i==n-1)
a=w;
if (i==n-p)
c=w;
if (i==p-1)
b=w;
}
a%=mod;
b%=mod;
c%=mod;
long long rez=a/((b*c)%mod);
rez%=mod;
freopen("sandokan.out","w",stdout);
printf("%lld",rez);
}
int main()
{
citire();
sandokan();
return 0;
}