ma muie

SUBMITTED BY: Guest

DATE: Oct. 11, 2016, 9:36 a.m.

FORMAT: Text only

SIZE: 730 Bytes

Raw Download

HITS: 790

Report
  1. #include<iostream>
  2. using namespace std;
  4. int n ,x[50];
  5. void afisare();
  6. void Back(int k);
  7. int Maxim(int p);
  8. int main()
  9. {
  10. cin>>n;
  11. Back(1);
  12. return 0;
  13. }
  14. void afisare()
  15. {
  16. int maxim=Maxim(n);
  17. for(int i=1;i<=maxim;++i)
  18. {
  19. cout<<" { ";
  20. for(int j=1;j<=n;j++)
  21. if(x[j]==i)
  22. cout<<j << " ";
  23. cout<<"}";
  24. }
  25. cout<<endl;
  26. }
  27. void Back(int k)
  28. {
  29. if(k==n+1)
  30. {
  31. afisare();
  32. return ;
  33. }
  34. for(int i=1;i<=Maxim(k-1)+1;i++)
  35. {
  36. x[k]=i;
  37. Back(k+1);
  38. }
  39. }
  40. int Maxim(int p)
  41. {
  42. int maxim=0;
  43. for(int i=1;i<=p;i++)
  44. if(x[i]>maxim)
  45. maxim=x[i];
  46. return maxim;
  47. }
comments powered by Disqus