Cod sursa(job #1412985)
Utilizator | Data | 1 aprilie 2015 17:59:44 | |
---|---|---|---|
Problema | Sandokan | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <cstdio>
#define MOD 2000003
using namespace std;
int n,K,a[5005],i,nr,sol[5005];
void comb(int k)
{
if (k>K)nr++,nr=nr%MOD;
else
{
for (i=sol[k-1]+1; i<=n; i++)
{
sol[k]=i;
comb(k+1);
}
k--;
}
return ;
}
int main()
{
freopen("sandokan.in","r",stdin);
freopen("sandokan.out","w",stdout);
scanf("%d %d",&n,&K);
for (i=1; i<=n; i++)
{
a[i]=i;
}
comb(1);
printf("%d",nr);
return 0;
}