Pagini recente » Cod sursa (job #178343) | Cod sursa (job #1027499) | Cod sursa (job #782604) | Cod sursa (job #3168306) | Cod sursa (job #1757465)
#include <cstdio>
using namespace std;
int x[10], n;
int Valid(int k)
{
int i;
for(i=1;i<=k-1;i++)
if (x[k]==x[i]) return 0;
return 1;
}
void Backtr(int k)
{
int i;
for(i=1;i<=n;i++)
{
x[k]=i;
if(Valid(k))
if(k==n)
{
for(int j=1;j<=n;j++)
printf("%d ",x[j]);
printf("\n");
}
else Backtr(k+1);
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
Backtr(1);
return 0;
}