Pagini recente » Cod sursa (job #1046862) | Cod sursa (job #2114213) | Cod sursa (job #790266) | Cod sursa (job #517303) | Cod sursa (job #765496)
Cod sursa(job #765496)
#include<cstdio>
int n,p,k,s[50],i;
int A(int s[50],int k)
{for(i=1;i<k;i++)
if(s[i]==s[k])
return 0;
return 1;}
int main()
{freopen("submultimi.in","r",stdin);
freopen("submultimi.out","w",stdout);
scanf("%d",&n);
for(p=1;p<=n;p++)
{k=1,s[k]=0;
while(k)
{s[k]++;
if(A(s,k))
if(s[k]<=n)
if(k==p)
{for(i=1;i<=k;i++)
printf("%d ",s[i]);
printf("\n");}
else
k++,s[k]=s[k-1];
else
k--;}}
return 0;}