Cod sursa(job #1202169)
Utilizator | Data | 27 iunie 2014 10:03:09 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n,x[8];
bool u[9];
void back(int k);
void printSolution();
int main()
{
fin>>n;
back(0);
return 0;
}
void back(int k)
{
if(k == n)
{
printSolution();
}
else
{
for(int i=1;i<=n;i++)
{
if(!u[i])
{
u[i] = true;
x[k] = i;
back(k+1);
u[i] = false;
}
}
}
}
void printSolution()
{
for(int i=0;i<n;i++)
{
fout<<x[i]<<' ';
}
fout<<'\n';
}