Pagini recente » Cod sursa (job #2222240) | Cod sursa (job #1506019) | Cod sursa (job #336156) | Cod sursa (job #2611088) | Cod sursa (job #469151)
Cod sursa(job #469151)
#include<stdio.h>
using namespace std;
int verificare(int a[], int n)
{ int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j&&a[i]==a[j]) return 0;
return 1;
}
void afisare(int a[], int n)
{ int i;
for(i=1;i<=n;i++)
printf("%d ",a[i]);
printf("\n");
}
int main()
{ int p[11],n,j;
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
p[0]=0;
for(j=1;j<=n;j++) p[j]=1;
while(!p[0])
{ p[n]++;
j=n;
while(p[j]>n)
{ p[j]=1;
p[j-1]++;
j--;
}
if(verificare(p,n)) afisare(p,n);
}
return 0;
}