Pagini recente » Monitorul de evaluare | Cod sursa (job #201356) | Rating slowguana (Slowguana) | Atasamentele paginii Clasament winners31 | Cod sursa (job #1640294)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin ("permutari.in");
ofstream fout ("permutari.out");
int st[10], v[10], N;
void Afisare()
{
for (int i=1; i<=N; i++)
fout << st[i] << " ";
fout << "\n";
}
void Back(int top)
{
int i;
if (top == N+1) Afisare();
else
for (i=1; i<=N; i++)
if (v[i] == 0)
{
st[top] = i;
v[i] = 1;
Back(top+1);
v[i] = 0;
}
}
int main ()
{
fin >> N;
Back(1);
fin.close();
fout.close();
return 0;
}