Pagini recente » Cod sursa (job #1914151) | Cod sursa (job #557977) | Cod sursa (job #2429222) | Cod sursa (job #1914477) | Cod sursa (job #1114046)
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
short n,k;
short sol[20];
int bun()
{
int v[9]={0,0,0,0,0,0,0,0,0};
for (int i=1;i<=n;i++)
v[sol[i]]++;
for (int i=1;i<=n;i++)
if (v[i]!=1)
return 0;
return 1;
}
int tip()
{
for (short i=1;i<=n;i++)
g<<sol[i]<<" ";
g<<'\n';
}
void back(short x)
{
if (x!=n+1)
{
for (short i=1;i<=n;i++)
{
sol[x]=i;
if (x==n && bun())
tip();
else
back(x+1);
}
}
}
int main()
{
f>>n;
back(1);
f.close();
g.close();
}