Pagini recente » Cod sursa (job #64820) | Cod sursa (job #677937) | Cod sursa (job #1742752) | Cod sursa (job #2110615) | Cod sursa (job #1332112)
#include <iostream>
#include <fstream>
using namespace std;
int n;
int s[10];
int uz[10];
ifstream in("permutari.in");
ofstream out("permutari.out");
void afisare()
{
for(int i=1;i<=n;i++)
out << s[i] << " ";
out << "\n";
}
void gen(int k)
{
if(k-1==n)
afisare();
else
{
for(int i=1;i<=n;i++)
{
if(uz[i]==0)
{
s[k]=i;
uz[i]=1;
gen(k+1);
uz[i]=0;
}
}
}
}
int main()
{
in >> n;
gen(1);
return 0;
}