Cod sursa(job #485989)
Utilizator | Data | 20 septembrie 2010 12:06:02 | |
---|---|---|---|
Problema | Submultimi | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<stdio.h>
int n,sol[20];
void afisare(int k)
{
for(int i=1;i<=k;++i)
printf("%d ",sol[i]);
printf("\n");
}
void bkt(int p,int k)
{
if(p==k+1)
{
afisare(k);
return;
}
for(int i=1+sol[p-1];i<=n-k+p;++i)
{
sol[p]=i;
bkt(p+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;++i)
bkt(1,i);
return 0;
}