Cod sursa(job #244211)
Utilizator | Diaconeasa Andrei AndreiD | Data | 14 ianuarie 2009 18:26:10 |
---|---|---|---|
Problema | Sandokan | Scor | 5 |
Compilator | c | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <stdio.h>
long long p;
int i,N,K,a[5000],max;
int main()
{
freopen("sandokan.in","r",stdin);
freopen("sandokan.out","w",stdout);
scanf("%d %d",&N,&K);
max=0;
for (i=1;i<=K;++i)
{
scanf("%d", &a[i]);
if (a[i]>max)
max=a[i];
}
p=1;
for (i=N-K;i<N;++i)
p=(p*i)%2000003;
for (i=2;i<K;++i)
p=(p/i);
printf("%lld", p);
return 0;
}