Pagini recente » Cod sursa (job #396774) | Cod sursa (job #1467845) | Cod sursa (job #1469085) | Cod sursa (job #135583) | Cod sursa (job #659989)
Cod sursa(job #659989)
#include <cstdio>
using namespace std;
int sol[9],n;
void afis()
{
for (int i=1;i<=n;i++) printf("%d ",sol[i]);
printf("\n");
}
bool ok(int i,int k)
{
for (int j=1;j<k;j++)
if(sol[j]==i) return false;
return true;
}
void back(int k)
{
int i;
if (k>n) afis();
else
for (i=1;i<=n;i++)
if (ok(i,k)==true)
{
sol[k]=i;
back(k+1);
}
}
int main () {
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
}