Pagini recente » Cod sursa (job #2770342) | Cod sursa (job #2421702) | Cod sursa (job #1807017) | Cod sursa (job #387996) | Cod sursa (job #2386903)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int a[10],n;
int valid(int t)
{
int j;
for(j=1; j<t; j++)
if(a[t]==a[j])
return 0;
return 1;
}
int sol(int x)
{
if(x==n)
return 1;
return 0;
}
void afis()
{
int j;
for(j=1; j<=n; j++)
g<<a[j]<<" ";
g<<"\n";
}
void bkt(int x)
{
int i;
for(i=1; i<=n; i++)
{
a[x]=i;
if(valid(x))
if(sol(x))
afis();
else
bkt(x+1);
}
}
int main()
{
f>>n;
bkt(1);
f.close();
g.close();
return 0;
}