Pagini recente » Cod sursa (job #2509680) | Cod sursa (job #3265865) | Cod sursa (job #959266) | Cod sursa (job #386190) | Cod sursa (job #617208)
Cod sursa(job #617208)
#include<stdio.h>
int n, a[20];
int bun(int m)
{
for(int j=1;j<=m; j++)
if(a[j]>=a[m])
return 0;
return 1;
}
void back(int i)
{
int k=1;
while(i>0&&k<=n)
{
while(i>0 && i<=k &&k<=n)
{
a[i]++;
if(a[i]>k)
{
a[i]=0;
i--;
}
if(bun(i))
i++;
}
if(i>k)
{
for(int j=1;j<=k;j++)
printf("%d ", a[j]);
printf("\n");
i=k;
}
k++;
}
}
int main()
{
freopen("submultimi.in", "r", stdin);
freopen("submultimi.out", "w", stdout);
scanf("%d", &n);
back(1);
return 0;
}