Pagini recente » Cod sursa (job #503009) | Cod sursa (job #2150344) | Cod sursa (job #212760) | Cod sursa (job #1998217) | Cod sursa (job #2220420)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int fv[12];
int v[12];
void solve(int x,int n)
{
if(x==n+1)
{
for(int i=1;i<=n;i++)
{
out<<v[i]<<" ";
}
out<<'\n';
}
else
{
for(int i=1;i<=n;i++)
{
if(fv[i]==0)
{
fv[i]=1;
v[x]=i;
solve(x+1,n);
fv[i]=0;
}
}
}
}
int main()
{
int n;
in>>n;
solve(1,n);
}