Pagini recente » Cod sursa (job #1935732) | Cod sursa (job #2186256) | Cod sursa (job #1523066) | Cod sursa (job #2869566) | Cod sursa (job #1523381)
#include <cstdio>
using namespace std;
int st[10],n,apar[10];
void solutie()
{
int i;
for(i = 1;i<=n;i++)
printf("%d ",st[i]);
printf("\n");
}
void back(int k)
{
int i;
for(i = 1;i<=n;i++)
{
if(!apar[i])
st[k] = i,apar[i] = 1;
else continue;
if(k==n)
solutie();
else
back(k + 1);
apar[i] = 0;
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
int i;
scanf("%d",&n);
back(1);
}