Pagini recente » Cod sursa (job #1946869) | Monitorul de evaluare | Cod sursa (job #961043) | numere_reale | Cod sursa (job #1035145)
/*
Keep It Simple!
*/
#include<stdio.h>
int n;
int v[20];
int valid(int k)
{
for(int i=1;i<k;i++)
if(v[i]==v[k])
return 0;
return 1;
}
void afis(int k)
{
for(int i=1;i<=k;i++)
printf("%d ",v[i]);
printf("\n");
}
void back(int k)
{
for(int i=v[k-1]+1;i<=n;i++)
{
v[k]=i;
if(valid(k))
{
afis(k);
if(k<n)
back(k+1);
}
}
}
int main()
{
freopen("submultimi.in","r",stdin);
freopen("submultimi.out","w",stdout);
scanf("%d",&n);
back(1);
}