Pagini recente » Istoria paginii runda/judet9-1/clasament | Istoria paginii runda/ffcxzczxczx/clasament | Istoria paginii runda/ffcxzczxczx/clasament | Cod sursa (job #2878798) | Cod sursa (job #269907)
Cod sursa(job #269907)
#include<stdio.h>
int N,V[20],H[20];
void back(int nivel)
{
int i;
if (nivel==N+1)
{
for (i=1;i<=N;++i) printf("%d",V[i]);
printf("\n");
}
for (i=1;i<=N;++i)
{
if (H[i]==1) continue;
H[i]=1; V[nivel]=i;
back(nivel+1);
H[i]=0;
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&N);
back(1);
}