Advertisement
Guest User

Untitled

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