Pagini recente » Cod sursa (job #1595492) | Cod sursa (job #608990) | Cod sursa (job #514233) | Cod sursa (job #747304) | Cod sursa (job #2920601)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
void print_solutie(int sol[10], int n)
{
for(int i =1; i<=n; i++)
{
out<<sol[i]<<" ";
}
out<<"\n";
}
void bkt (int p, int n, int sol[10], bool visited[10])
{
if(p==n+1)
{
print_solutie(sol,n);
return;
}
for(int i=1; i<=n; i++)
{
if(visited[i]==0)
{
sol[p]=i;
visited[i]=1;
bkt(p+1,n,sol,visited);
visited[i]=0;
}
}
}
int main()
{
int n;
int sol[10];
bool visited[10]={0};
in>>n;
bkt(1,n,sol,visited);
return 0;
}