Pagini recente » Cod sursa (job #2725826) | Cod sursa (job #1457073) | Cod sursa (job #1827071) | Cod sursa (job #2792461) | Cod sursa (job #2437774)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("permutari.in");
ofstream fo("permutari.out");
int v[9];
int n;
int valid(int k)
{
for(int i=1;i<k;i++)
if(v[i]==v[k])
return 0;
return 1;
}
int sol(int k)
{
return k==n;
}
void afis(int k)
{
for(int i=1;i<=k;i++)
fo<<v[i]<<" ";
fo<<'\n';
}
void bkt()
{
int k;
k=1;
v[k]=0;
while(k>=1)
if(v[k]<n)
{
v[k]++;
if(valid(k))
if(sol(k))
afis(k);
else
{
k++;
v[k]=0;
}
}
else
k--;
}
int main()
{
fi>>n;
bkt();
return 0;
}