Cod sursa(job #1703205)
Utilizator | Data | 16 mai 2016 16:14:44 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n,v[10],fol[10],p;
void permut(int p){
if(p>n)
{
for(int i=1;i<=n;++i)
fout<<v[i]<<" ";
fout<<"\n";
return;
}
for(int i=1;i<=n;++i)
if(fol[i]==0)
{fol[i]=1;
v[p]=i;
permut(p+1);
fol[i]=0;}
}
int main()
{
fin>>n;
permut(1);
return 0;
}