Pagini recente » Cod sursa (job #536478) | Cod sursa (job #1359238) | Cod sursa (job #1695217) | Cod sursa (job #1484530) | Cod sursa (job #1542712)
#include <iostream>
#include <cstdio>
using namespace std;
int valid(int x[],int k)
{
for(int i=1;i<k;i++)
if(x[i]==x[k])
return 0;
return 1;
}
void afisare(int x[],int k)
{
for(int i=1;i<=k;i++)
printf("%d ",x[i]);
printf("\n");
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
int x[10],n,k;
scanf("%d",&n);
x[k=1]=1;
while(k)
{
if(x[k]>n)
x[--k]++;
else if(valid(x,k))
{
if(k==n)
{
afisare(x,k);
x[k]++;
}
else
x[++k]=1;
}
else
x[k]++;
}
return 0;
}