Cod sursa(job #3123118)
Utilizator | Data | 22 aprilie 2023 07:50:09 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<iostream>
using namespace std;
int n, stack[1001];
int valid(int level){
for(int i=1; i<level; i++){
if(stack[i]==stack[level]) return 0;
}
return 1;
}
void solve(int level)
{
if(level==n+1) {
for(int i=1; i<=n; i++)
{
cout<<stack[i]<< " ";
} cout<<endl;
}
else {
for(int i=1; i<=n; i++)
{
stack[level]=i;
if(valid(level)) solve(level+1);
}
}
}
int main()
{
n=3;
solve(1);
}