Pagini recente » Cod sursa (job #2494093) | Cod sursa (job #1035597) | Cod sursa (job #277239) | Cod sursa (job #2136379) | Cod sursa (job #570187)
Cod sursa(job #570187)
#include<stdio.h>
#include<math.h>
int a[100],i,j,n,m,b[1000];
int main()
{
freopen("submultimi.in","r",stdin);
freopen("submultimi.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
b[i]=i;
m=pow(2,n)-1;
for(i=1;i<=m;i++)
{j=1;
while(a[j]!=0)
j++;
a[j]=1;
for(j=j-1;j>=1;j--)
a[j]=0;
for(j=1;j<=n;j++)
if(a[j]!=0)
printf("%d ",j);
printf("\n");
}
return 0;}