Pagini recente » Cod sursa (job #114656) | Cod sursa (job #1145763) | Cod sursa (job #2331686) | Cod sursa (job #71470) | Cod sursa (job #1595683)
#include <cstdio>
using namespace std;
int n,x[20];
int verif(int k)
{
for(int i=1; i<k; i++)
if(x[i]==x[k])
return 0;
return 1;
}
void afisare()
{
for(int i=1; i<=n; i++)
printf("%d ", x[i]);
printf("\n");
}
void back(int k)
{
if(k==n+1) afisare();
else
for(x[k]=1; x[k]<=n; x[k]++)
if(verif(k))
back(k + 1);
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d", &n);
back(1);
return 0;
}