Advertisement
Guest User

Untitled

a guest
Apr 27th, 2018
58
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.61 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3. const int N=50;
  4. int i,st[N],k,C[100],n,as,ev;
  5.  
  6. void init(){st[k]=0;}
  7. void succesor(){as=0;
  8. if(st[k]<C[k])
  9. {
  10. as=1;
  11. st[k]++;
  12. }
  13.  
  14. }
  15. void valid(){ev=1;}
  16.  
  17. void tipar(){int i;
  18. for(i=1;i<=n;++i) cout<<st[i];
  19. cout<<endl;}
  20.  
  21. int solutie(){return k==n;}
  22.  
  23. void backk(){k=1;
  24. init();
  25. while(k) { do{
  26. succesor();
  27. if(as) valid();
  28. } while(as&&!ev);
  29. if(as) if(solutie()) tipar();
  30. else{++k;init();}
  31. else --k;}}
  32.  
  33.  
  34. int main(){
  35. cout<<"Dati n:";
  36. cin>>n;
  37. cout<<"Dati elementele:";
  38. for(i=1;i<=n;++i) cin>>C[i];
  39. backk();
  40.  
  41. return 0;
  42.  
  43. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement