Advertisement
Guest User

Untitled

a guest
Oct 21st, 2017
67
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.48 KB | None | 0 0
  1. #include<iostream>
  2. using namespace std;
  3.  
  4. int a[2]={ 4,3};
  5. int st[2];
  6. int n=2;
  7.  
  8. 1) l7
  9.  
  10.  
  11. int succesor(int k, int i)
  12. {
  13. if (i<=a[k])
  14. {st[k]=i;
  15. return 1;}
  16. else return 0;
  17. }
  18.  
  19. void tipar(int k)
  20. {
  21. for(int i=0;i<k;i++)
  22. cout<<st[i]<<" ";
  23. cout<<endl;
  24. }
  25. int solutie(int k)
  26. {
  27. return k==n;
  28. }
  29. void back(int k)
  30. {
  31. if (solutie(k))
  32. tipar(k);
  33. else{
  34. int i=1;
  35. while(succesor(k,i))
  36. {
  37. back(k+1);
  38. i++;
  39. }}}
  40. void main()
  41. {
  42. back(0);
  43. system("pause");
  44. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement