Pagini recente » Cod sursa (job #1561333) | Cod sursa (job #1753460) | Cod sursa (job #2868569) | Cod sursa (job #139048) | Cod sursa (job #2186739)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n, x[10];
int valid(int k)
{
for(int i = 1; i < k; i++)
if(x[k] == x[i])
return 0;
return 1;
}
void afis()
{
//nrsol++;
for(int i = 1; i <= n; i++)
g<< x[i] << ' ';
g << endl;
}
void backt(int k)
{ if(k==n+1)afis();
else
for(int i = 1; i <= n; i++)
{
x[k] = i;
if(valid(k))
{
if(k == n)
afis();
else
backt(k + 1);
}
}
}
int main()
{
f >> n;
backt(1);
//cout << "Numar solutii: " << nrsol << endl;
return 0;
}