Pagini recente » Cod sursa (job #2107280) | Cod sursa (job #1037654) | Cod sursa (job #1929893) | Cod sursa (job #2227701) | Cod sursa (job #162071)
Cod sursa(job #162071)
#include<stdio.h>
int n,sol[10];
void scrie()
{
for(int i=1; i<n; i++)
printf("%d ",sol[i]);
printf("%d\n",sol[n]);
}
/*
int valid(int k)
{
for(int i=1;i<k; i++)
if(sol[i]==sol[k])
return 0;
return 1;
}*/
bool marcat[10];
void back(int k)
{
if(k==n+1)
{
scrie();
return;
}
for(int i=1; i<=n; i++)
{
//sol[k]=i;
//if(valid(k))
//back(k+1);
if(!marcat[i])
{
marcat[i]=true;
sol[k]=i;
back(k+1);
marcat[i]=false;
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}