Cod sursa(job #418278)
Utilizator | Velicu Stefan veliki.velicu | Data | 15 martie 2010 18:42:11 |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ofstream out("permutari.out");
ifstream in("permutari.in");
int n, sol[10];
void afisare()
{
int i;
for(i=1; i<=n; i++)
out<<sol[i]<<' ';
out<<"\n";
}
bool valid(int p)
{
int i;
for(i=1; i<p; i++)
if(sol[i] == sol[p])
return false;
return true;
}
void back(int p)
{
if(p == n+1)
{
afisare();
return;
}
for(int i=1; i<=n; i++)
{
sol[p] = i;
if(valid(p))
back(p+1);
}
}
int main()
{
in>>n;
back(1);
return 0;
}