Pagini recente » Cod sursa (job #2322750) | Cod sursa (job #1903310) | Cod sursa (job #939094) | Cod sursa (job #1901709) | Cod sursa (job #2061001)
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n,x[20];
int cont(int pas)
{
for (int i=1; i<pas; i++)
if (x[i] == x[pas])
return 0;
return 1;
}
void back(int pas)
{
if (pas > n)
{
for (int i=1; i<=n; i++)
fout << x[i] << " ";
fout << "\n";
return;
}
for (int i=1; i<=n; i++)
{
x[pas] = i;
if (cont(pas) == 1)
back(pas+1);
}
}
int main()
{
fin >> n;
back(1);
return 0;
}