Pagini recente » Cod sursa (job #1795713) | Cod sursa (job #415936) | Cod sursa (job #1455020) | Cod sursa (job #1303434) | Cod sursa (job #1464253)
#include <cstdio>
using namespace std;
int n, a[10];
void afisare()
{
for(int i=1;i<=n;i++)
printf("%d ",a[i]);
printf("\n");
}
bool valid(int k)
{
for(int i=1;i<k;i++)
if(a[i]==a[k])
return 0;
return 1;
}
void bak(int k)
{
for(int i=1;i<=n;i++)
{
a[k]=i;
if(valid(k))
{
if(k==n)
afisare();
else
bak(k+1);
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
bak(1);
return 0;
}