Advertisement
Guest User

Untitled

a guest
Sep 17th, 2019
128
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.92 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. int n,st[10],k;
  6.  
  7. void init()
  8. {
  9. st[k]=0;
  10. }
  11.  
  12. int suc()
  13. {
  14. if(st[k]<n)
  15. {
  16. st[k]++;
  17. return 1;
  18. }
  19. return 0;
  20. }
  21.  
  22. int valid()
  23. {
  24. int i;
  25. for(i=1; i<=k-1; i++)
  26. if(st[k]==st[i])
  27. return 0;
  28. return 1;
  29.  
  30. }
  31.  
  32. int sol()
  33. {
  34. if(k==n)
  35. return 1;
  36. return 0;
  37. }
  38.  
  39. void afis()
  40. {
  41. int i;
  42. for(i=1; i<=n; i++)
  43. cout<<st[i]<<" ";
  44. cout<<endl;
  45.  
  46. }
  47.  
  48. void back()
  49. {
  50. int s;
  51. k=1;
  52. int();
  53. while(k)
  54. {
  55.  
  56.  
  57. do
  58. {
  59.  
  60. }
  61. while((s=suc())&& valid()==0);
  62. if(s==1)
  63. if(sol()==1)
  64. afis();
  65. else
  66. {
  67. k++;
  68. init();
  69.  
  70. }
  71. else
  72. k--;
  73. }
  74.  
  75. }
  76. int main()
  77. {
  78. cout<<"n=";
  79. cin>>n;
  80. back();
  81. return 0;
  82. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement