Pagini recente » Cod sursa (job #2069509) | Cod sursa (job #449386) | Istoria paginii runda/123124 | Cod sursa (job #2713299) | Cod sursa (job #2036855)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int sol[9],fol[9],n;
void afis(int n)
{
for(int i=1;i<=n;++i)
g<<sol[i]<<" ";
g<<"\n";
}
int bact(int pas)
{
if(pas>n)
{
afis(n);
}
else
for(int i=1;i<=n;++i)
{
if(!fol[i])
{
sol[pas]=i;
fol[i]=1;
bact(pas+1);
fol[i]=0;
}
}
}
int main()
{
f>>n;
bact(1);
return 0;
}