Advertisement
Guest User

Untitled

a guest
Sep 18th, 2019
99
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.96 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int st[10],n;
  4. int valid(int k)
  5. {
  6. for(int i=1;i<k;i++)
  7. if(st[k]==st[i])
  8. {return 0;}
  9. return 1;
  10. }
  11. int solutie(int k)
  12. {
  13. return k==n;
  14. }
  15. void tipar(int k)
  16. {
  17. for(int i=1;i<=k;i++)
  18. {for(int j=1;j<=k;j++)
  19. if(j==st[i])
  20. cout<<"T";
  21. else
  22. cout<<"0";
  23. cout<<endl;
  24. }
  25. cout<<endl;
  26. }
  27. void init(int k)
  28. {
  29. st[k]=0;
  30. }
  31. int succesor(int k)
  32. {
  33. if(st[k]<n)
  34. {st[k]++;
  35. return 1;}
  36. else
  37. {return 0;}
  38. }
  39. void back()
  40. {
  41. int k,Ev,As;
  42. k=1;
  43. init(k);
  44. while(k>=1)
  45. {do{
  46. As=succesor(k);
  47. if(As==1)
  48. {Ev=valid(k);}}
  49. while(As==1&&Ev==0);
  50. if(As==1){
  51. if(solutie(k)){
  52. tipar(k);}
  53. else{
  54. k++;
  55. init(k);}
  56. }
  57. else{
  58. k--;
  59. }}
  60. }
  61. int main()
  62. {
  63. cout<<"n=";
  64. cin>>n;
  65. back();
  66. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement