Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- #define NR 10
- int x[NR],n;
- int folosit[NR];
- void backr(int k)
- {
- if(k>n)
- {
- for(int i=1;i<=n;++i)
- cout<<x[i]<<' ';
- cout<<'\n';
- }
- else
- for(int i=1;i<=n;++i)
- {
- x[k]=i;
- if(!folosit[x[k]]) /// Daca elementul curent nu e deja folosit
- {
- folosit[x[k]]=1; /// Marcheaza-l ca folosit
- backr(k+1);
- /// Genereaza restul permutarii
- folosit[x[k]]=0; /// Demarcheaza elementul
- }
- }
- }
- int main()
- {
- cout<<"Dati n:";cin>>n;
- backr(1);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement