Cod sursa(job #1428422)
Utilizator | Data | 4 mai 2015 15:29:30 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
using namespace std;
int n, v[10];
void afis()
{
for(int i=1;i<=n;i++)
cout<<v[i]<<" ";
cout<<'\n';
}
int verif(int k)
{
for(int i=1;i<=k-1;i++)
if(v[i]==v[k])
return 0;
return 1;
}
void back(int k)
{
if(k<=n)
{
for(int i=1;i<=n;i++)
{
v[k]=i;
if(verif(k))
back(k+1);
}
}
else
afis();
}
int main()
{
cin>>n;
back(1);
return 0;
}