Pagini recente » Istoria paginii runda/oji_simulare_02/clasament | Cod sursa (job #125074) | Cod sursa (job #1729737) | Cod sursa (job #1941221) | Cod sursa (job #269933)
Cod sursa(job #269933)
#include<stdio.h>
int n,sol[100],h[100];
void back(int k)
{
int i;
if(k==n+1)
{
for(i=1;i<=n;i++)
printf("%d ",sol[i]);
printf("\n");
}
else
{
for(i=1;i<=n;i++)
{
if(h[i]==1) continue;
h[i]=1;sol[k]=i;
back(k+1);
h[i]=0;
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}