Pagini recente » Cod sursa (job #2387208) | Cod sursa (job #2186742) | Cod sursa (job #193014) | Cod sursa (job #2891053) | Cod sursa (job #163687)
Cod sursa(job #163687)
#include<stdio.h>
long n,k;
long v[50005];
void scan()
{
scanf("%ld%ld",&n,&k);
for (int i=1;i<=n;i++)
scanf("%ld",&v[i]);
}
void combinari(long n,long k)
{
long comb,c1;
comb=1;
long i;
for (i=1;i<=k;i++)
{c1=(comb * ((n-i+1)/i)%2000003)%2000003;
comb=c1;
}
printf("%ld\n",comb);
}
int main()
{
freopen("sandokan.in","r",stdin);
freopen("sandokan.out","w",stdout);
scan();
int i,l=1;
long r,cn;
cn=n;
while (n>=k)
{
n-=k-1;
}
if (n==1)
printf("1\n");
else combinari(cn-1,n-1);
if (k==n)
{
for (i=1;i<=n;i++)
{
if (v[i]==v[i+1])
{printf("0\n");
return 0;
}
}
}
return 0;
}