Cod sursa(job #2151112)
Utilizator | Data | 4 martie 2018 09:03:24 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#define nmax 101
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int N,sol[nmax],viz[nmax];
void answer(int k)
{
if(k==N+1)
{
for(int i =1; i < k ; i++)
fout<<sol[i]<<" ";
fout<<'\n';
}
else
{
for(int i =1 ; i <= N ; i++)
if(!viz[i])
{
viz[i]=1;
sol[k]=i;
answer(k+1);
viz[i]=0;
}
}
}
int main()
{
fin>>N;
answer(1);
return 0;
}