Advertisement
Guest User

Untitled

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