Pagini recente » Cod sursa (job #793269) | Cod sursa (job #3186425) | Cod sursa (job #3276955) | Cod sursa (job #3219542) | Cod sursa (job #1568587)
#include<cstdio>
using namespace std;
int v[9],n;
bool km9[9];
void print()
{
for(int i=0;i<n;i++) printf("%d ",v[i]);
printf("\n");
}
bool ok()
{
bool flag=1;
for(int i=0;i<n;i++) km9[v[i]-1]=1;
for(int i=0;i<n;i++) if(!km9[i]) flag=0;
for(int i=0;i<n;i++) km9[i]=0;
return flag;
}
void bt(int k)
{
for(int a=1; a<=n; a++)
{
v[k]=a;
if(k<n-1) bt(k+1);
else if(ok()) print();
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
bt(0);
}