Cod sursa(job #1576127)
Utilizator | Data | 22 ianuarie 2016 09:26:36 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.73 kb |
#include <iostream>
using namespace std;
int s[1000];
int n,k;
int backtr(int k)
{
int i,j;
bool ok;
if (n==k)
{
for (i=1;i<=n;i++)
cout<<s[i]<<" ";
cout<<endl;
}
else
{
for (i=1;i<=n;i++)
{
ok=true;
for (j=1;j<=k;j++)
if (s[j]==i)
{
ok=false;
break;
}
if (ok)
{
s[k+1]=i;
backtr(k+1);
}
}
}
}
int main()
{
cin>>n;
backtr(0);
return 0;
}