Pagini recente » Cod sursa (job #4781) | Cod sursa (job #3153404) | Cod sursa (job #2178119) | Cod sursa (job #15167) | Cod sursa (job #527133)
Cod sursa(job #527133)
#include<stdio.h>
int n,put[20],sol[20];
void afis(int k)
{
for (int i=1;i<=k-1;i++)
printf("%d ",sol[i]);
printf("\n");
}
void back(int k)
{
int i;
if (k!=1) afis(k);
for (i=sol[k-1]+1;i<=n;i++)
if (!put[i])
{
put[i]=1;
sol[k]=i;
back(k+1);
put[i]=0;
}
}
int main()
{
freopen("submultimi.in","r",stdin);
freopen("submultimi.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}