Cod sursa(job #416553)
Utilizator | Roti Andrei andreir | Data | 12 martie 2010 22:14:50 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
const int N_max=22;
int st[N_max],n,k;
void bkt(int p,int l)
{
int i;
if(p==k+1)
{
for(i=1;i<=k;i++)
printf("%d ",st[i]);
printf("\n");
return;
}
for(i=l+1;i<=n-k+p;i++)
{
st[p]=i;
bkt(p+1,i);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
bkt(1,0);
return 0;
}