Pagini recente » Cod sursa (job #1511109) | Cod sursa (job #2933824) | Atasamentele paginii haicatrebuiesatrebuiasca | Cod sursa (job #2380038) | Cod sursa (job #1676621)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n, sol[100];
bool app[100];
void display()
{
for(int i = 1; i <= n; ++i)
{
fout << sol[i] << " ";
}
fout << endl;
}
void bkt(int k)
{
if(k == n + 1)
{
display();
return;
}
else
{
for(int i = 1; i <= n; ++i)
{
if(!app[i])
{
sol[k] = i;
app[i] = true;
bkt(k+1);
app[i] = false;
}
}
}
}
int main(void)
{
fin >> n;
bkt(1);
return 0;
}