Pagini recente » Cod sursa (job #2215392) | Cod sursa (job #2068327) | Cod sursa (job #254808) | Cod sursa (job #2254791) | Cod sursa (job #307839)
Cod sursa(job #307839)
#include<stdio.h>
int n,v[10],p[10];
void readd(), solve(), gen(int poz), afiseaza();
int main()
{
readd();
solve();
return 0;
}
void readd()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
}
void solve()
{
gen(1);
}
void gen(int poz)
{
int i;
if(poz==n+1){afiseaza();return;}
for(i=1;i<=n;i++)
if(v[i]==0)
{
p[poz]=i;
v[i]=1;
gen(poz+1);
v[i]=0;
}
}
void afiseaza()
{
int i;
for(i=1;i<=n;i++)
printf("%d ",p[i]);
printf("\n");
}