Pagini recente » Cod sursa (job #3293665) | Cod sursa (job #47094) | Cod sursa (job #2179713) | Cod sursa (job #1892467) | Cod sursa (job #3003419)
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
const int Nmax=15;
int nr=1,n1;
int v[Nmax],f[Nmax];
void solve(int n)
{
if(n==0)
{
for(int i=1;i<=n1;i++)
{
fout<<v[i]<<' ';
}
fout<<'\n';
v[n1]=0;
f[v[n1]]=0;
return;
}
else
{
for(int i=1;i<=n1;i++)
{
if(f[i]==0)
{
v[n1-n+1]=i;
f[i]=1;
solve(n-1);
v[n1-n+1]=0;
f[i]=0;
}
}
return;
}
}
int main()
{
int n;
fin>>n;
n1=n;
solve(n);
return 0;
}