Pagini recente » Cod sursa (job #459653) | Cod sursa (job #2868834) | Cod sursa (job #3233518) | Cod sursa (job #3280035) | Cod sursa (job #987981)
Cod sursa(job #987981)
#include <cstdio>
using namespace std;
int n,a[8];
void back(int k)
{
int i,j,e;
for(i=0;i<n;++i)
{
e=1;
for(j=0;j<k&&e;++j) if(a[j]==i+1) e=0;
if(e)
{
a[k]=i+1;
if(k==n-1)
{
for(j=0;j<n;++j) printf("%d ",a[j]);
printf("\n");
}
else back(k+1);
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(0);
return 0;
}