Pagini recente » Cod sursa (job #1106446) | Cod sursa (job #693891) | Cod sursa (job #200406) | Cod sursa (job #1982298) | Cod sursa (job #1736123)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int v[10];
int n;
void afisare()
{
for(int i=1; i<=n; i++)
out<<v[i]<<' ';
out<<endl;
}
int valid(int k)
{
for(int i=1; i<k; i++)
if(v[k]==v[i])
return 0;
return 1;
}
void bkt(int k)
{
if(k==n+1)
afisare();
else
for(int i=1; i<=n; i++)
{
v[k]=i;
if(valid(k))
bkt(k+1);
}
}
int main()
{
in>>n;
bkt(1);
return 0;
}