Pagini recente » Cod sursa (job #2155933) | Cod sursa (job #1924919) | Cod sursa (job #2045529) | Cod sursa (job #2692464) | Cod sursa (job #733475)
Cod sursa(job #733475)
#include<stdio.h>
int sol[15],n;
void back(int k)
{
if(k>n)
{ for(int i=1;i<=n;++i) printf("%d ",sol[i]);
printf("\n"); }
else
{ for(int i=1;i<=n;++i){
bool found = false;
for(int j=1;j<k;j++) if(sol[j]==i) { found = true; break ; }
if(!found) { sol[k]=i; back (k + 1) ; }
}
}
}
int main ()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}