Pagini recente » Cod sursa (job #2742286) | Cod sursa (job #3191439) | Cod sursa (job #3216165) | Cod sursa (job #1774804) | Cod sursa (job #2035139)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
#define lim 10
int n;
int s[lim];
void afisare (int n)
{
for (int i=1; i<=n; i++)
fout<<s[i]<<' ';
fout<<'\n';
}
bool valid (int k)
{
for (int i=1; i<k; i++)
if (s[i]==s[k]) return false;
return true;
}
void backk (int k)
{
for (int i=1; i<=n; i++)
{
s[k]=i;
if (valid(k))
if (k==n) afisare(k);
else backk(k+1);
}
}
int main()
{
fin>>n;
backk(1);
fin.close();
fout.close();
return 0;
}