Pagini recente » Cod sursa (job #1665284) | Cod sursa (job #2316758) | Cod sursa (job #1479360) | Solutii Autumn Warmup, Runda 3 | Cod sursa (job #1943532)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int lista[8],frecv[9],nr;
void makePermutation(int n,int pas){
int i;
if(pas==n){
for(i=0;i<n;i++)
fout<<lista[i]<<' ';
fout<<endl;
}
else{
for(i=1;i<=n;i++){
if(frecv[i]==0){
lista[nr]=i;
frecv[i]=1;
nr++;
makePermutation(n,pas+1);
frecv[i]=0;
nr--;
}
}
}
}
int main()
{
int n;
fin>>n;
makePermutation(n,0);
return 0;
}