Pagini recente » Cod sursa (job #1761365) | Cod sursa (job #522411) | Cod sursa (job #1023508) | Borderou de evaluare (job #1810931) | Cod sursa (job #1266745)
#include <iostream>
#include <cstdio>
using namespace std;
int n,sol[10];
void afis()
{
for(int i=1; i<=n; i++)printf("%d ",sol[i]);
printf("\n");
}
int valid(int k)
{
for(int i=1; i<k; i++)if(sol[i]==sol[k])return 0;
return 1;
}
void gen(int k)
{
if(k>n)afis();
else{
for(int i=1; i<=n; i++){sol[k]=i; if(valid(k))gen(k+1); }
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
scanf("%d",&n);
gen(1);
return 0;
}