Pagini recente » Cod sursa (job #1998850) | Cod sursa (job #1356747) | Cod sursa (job #672291) | Cod sursa (job #821092) | Cod sursa (job #1817259)
#include <iostream>
#include <fstream>
using namespace std;
int v[10],n;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
void print()
{
for (int i=1;i<=n;i++)
fout<<v[i]<<" ";
fout<<"\n";
}
int valid(int k)
{
for (int i =1;i<=k-1;i++)
if (v[k]==v[i])
return 0;
return 1;
}
void back(int k)
{
for (v[k]=1;v[k]<=n;v[k]++)
if (valid(k))
if (k==n)
print();
else
back(k+1);
}
int main()
{
fin>>n;
back(1);
return 0;
}