Pagini recente » Cod sursa (job #802705) | Borderou de evaluare (job #1198266) | Borderou de evaluare (job #2034982) | Cod sursa (job #921910) | Cod sursa (job #485996)
Cod sursa(job #485996)
#include<stdio.h>
int n,k;
int sol[17];
void afisare()
{
for(int i=1;i<=k;++i)
printf("%d ",sol[i]);
printf("\n");
}
void bkt (int p)
{
if(p==k+1)
{
afisare();
return;
}
for(int i=(sol[p-1] +1); i<=(n-k+p);++i)
{
sol[p] = i;
bkt(p+1);
}
}
int main()
{
freopen("submultimi.in","r",stdin);
freopen("submultimi.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
k=i;
bkt(1);
}
return 0;
}