Cod sursa(job #2288998)
Utilizator | Baroncea Andrei Baroncea | Data | 24 noiembrie 2018 10:12:34 |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int T[100],n,k=1;
bool viz[100];
void genk(int k)
{
if(k==n+1)
{
for(int i=1; i<=n; i++)
fout<<T[i]<<" ";
fout<<'\n';
}
else
{
for(int i=1; i<=n; i++)
{
if(!viz[i])
{
viz[i]=1;
T[k]=i;
genk(k+1);
viz[i]=0;
}
}
}
}
int main()
{
fin>>n;
genk(k);
return 0;
}