Cod sursa(job #617212)
| Utilizator | Data | 14 octombrie 2011 11:03:45 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#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 j)
{
int k=(1<<n)-1;
for(int i=1; i<=k; i++)
{
a[j]++;
if(a[j]>n)
{
a[j]=0;
j--;
}
if(bun(j))
j++;
if(j>n)
{
for(int b=1;b<=k;b++)
printf("%d ", a[b]);
printf("\n");
}
}
}
int main()
{
freopen("submultimi.in", "r", stdin);
freopen("submultimi.out", "w", stdout);
scanf("%d", &n);
back(1);
return 0;
}
