Pagini recente » Istoria paginii runda/eusebiu_oji_2014_cls9/clasament | Istoria paginii runda/lol/clasament | Istoria paginii runda/cocaine_for_my_breakfast | Istoria paginii runda/oji10 | Cod sursa (job #2126888)
#include <iostream>
#include <fstream>
#define MAX 25
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int N;
int ST[MAX];
bool Verif[MAX];
void Afisare()
{
for ( int i = 1; i <= N ; ++i)
out << ST[i] <<" ";
out << endl;
}
void Back(int Top)
{
if ( Top == N + 1) Afisare();
else for ( int i = 1; i <= N ; ++i)
if(Verif[i] == false)
{
Verif[i] = true;
ST[Top] = i;
Back(Top+1);
Verif[i] = false;
}
}
int main()
{
in >> N;
Back(1);
return 0;
}