Pagini recente » Cod sursa (job #2222011) | Borderou de evaluare (job #509620) | Cod sursa (job #899375) | Cod sursa (job #1985488) | Cod sursa (job #456100)
Cod sursa(job #456100)
#include<stdio.h>
int v[10];
void back(int n,int k)
{
int i,j;
if (k==n)
{
for(i=1;i<=n;i++)
printf("%i ",v[i]);
printf("\n");
}
else
{
for(i=1;i<=n;i++)
{
int ok=1;
for(j=1;j<=k && ok;j++)
if (v[j]==i) ok=0;
if (ok)
{
v[k+1]=i;
back(n,k+1);
}
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
int n;
scanf("%i",&n);
back(n,0);
return 0;
}