Pagini recente » Cod sursa (job #667844) | Istoria paginii utilizator/stefaniafintina | Istoria paginii utilizator/churchil | Cod sursa (job #1049757) | Cod sursa (job #1287831)
#include <iostream>
#include <fstream>
using namespace std;
ifstream ka("permutari.in");
ofstream ki("permutari.out");
int n, v[10], t;
void afisare()
{
for(int i = 1; i <= n; i++)
ki << v[i] << " ";
ki << '\n';
}
void back(int k)
{
if(k == n)
afisare();
else
{
for(int i = 1; i <= n; i++)
{
bool gasit = false;
for(int j = 1; j <= k && !gasit; j++)
if(v[j] == i)
gasit = true;
if(!gasit)
{
v[k + 1] = i;
back(k + 1);
}
}
}
}
int main()
{
ka >> n;
back(0);
}