Pagini recente » Cod sursa (job #1460820) | Cod sursa (job #460926) | Cod sursa (job #1691044) | Cod sursa (job #57631) | Cod sursa (job #1413028)
#include <cstdio>
using namespace std;
int n,k,v[5010],Max=0,nr=0,p1,p2,i,x;
double comb;
int main()
{
freopen("sandokan.in","r",stdin);
freopen("sandokan.out","w",stdout);
scanf("%d %d\n",&n,&k);
comb=1.0;
if(n==k)
printf("1\n");
else
{
for(i=1; i<=n; ++i)
{
scanf("%d ",&v[i]);
if(v[i]>Max)
Max=v[i];
}
for(i=1; i<=n; ++i)
if(v[i]!=Max)
++nr;
p1=nr;
p2=k-1;
for(i=1; i<=k-1; ++i)
{
comb=(double)comb*p1/p2;
--p1;
--p2;
if((int)comb==comb)
{
x=(int)comb%2000003;
comb=x*1.0;
}
}
printf("%d\n",(int)(comb));
}
return 0;
}