Cod sursa(job #595717)
Utilizator | Data | 13 iunie 2011 18:45:56 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
using namespace std;
int n, s[8];
void back(int k)
{
if (k>=n)
{
for (int i=0; i<n;i++)
cout<<s[i];
cout<<"\n";
}
else {
s[k]=0;
while ((s[k]++)<n)
{
int is_valid = true;
for (int i=0;i<k;i++)
if (s[i]==s[k]) is_valid=false;
if (is_valid) back(k+1);
}
}
}
int main()
{
cout<<"n="; cin>>n;
back(0);
cin.get();
return 0;
}