Pagini recente » Borderou de evaluare (job #2040654) | Cod sursa (job #265662) | Borderou de evaluare (job #2912695) | Borderou de evaluare (job #1888314) | Cod sursa (job #1360267)
#include <cstdio>
using namespace std;
int n,x[16];
void print()
{
for(int i=1;i<=n;++i)
printf("%d ",x[i]);
printf("\n");
}
int valid(int k)
{
for(int i=1;i<k;++i)
if(x[k]==x[i])
return 0;
return 1;
}
void backtracking(int k)
{
for(int i=1;i<=n;++i)
{
x[k]=i;
if(valid(k))
{
if(k==n)
print();
else
backtracking(k+1);
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
backtracking(1);
return 0;
}