Pagini recente » Cod sursa (job #233300) | Cod sursa (job #2839099) | Cod sursa (job #194012) | Cod sursa (job #3226841) | Cod sursa (job #2197361)
#include <iostream>
#include <fstream>
#define NUM 10
int ocup[NUM];
int v[NUM];
int n;
using namespace std;
void afisare()
{
ofstream g("permutari.out");
for(int i = 0; i < n; ++i)
g << v[i] << " ";
g << "\n";
g.close();
}
void backt(int k)
{
if(k == n)
afisare();
else
{
for(int i = 1; i <= n; ++i)
{
if(!ocup[i])
{
v[k] = i;
ocup[i] = 1;
backt(k+1);
ocup[i] = 0;
}
}
}
}
int main()
{
ifstream f("permutari.in");
f >> n;
backt(0);
f.close();
}