Advertisement
Guest User

Untitled

a guest
Dec 5th, 2019
83
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. #include <cstring>
  3. using namespace std;
  4. int st[11], n;
  5. bool valid(int k)
  6. {
  7. for(int i=1; i<k; i++)
  8. {
  9. if(st[k]==st[i])
  10. {
  11. return 0;
  12. }
  13. }
  14. return 1;
  15. }
  16. bool solutie(int k)
  17. {
  18. return k==n;
  19. }
  20. void afis(int k)
  21. {
  22. for(int i=1; i<=n; i++)
  23. {
  24. for(int j=1; j<=n; j++)
  25. {
  26. if(st[i]==j)
  27. {
  28. cout<<"1";
  29. }
  30. else
  31. {
  32. cout<<"0";
  33. }
  34. }
  35. cout<<endl;
  36. }
  37. cout<<endl;
  38. }
  39. void back(int k)
  40. {
  41. for(int i=1; i<=n; i++)
  42. {
  43. st[k]=i;
  44. if(valid(k))
  45. {
  46. if(solutie(k))
  47. {
  48. afis(k);
  49. }
  50. else
  51. {
  52. back(k+1);
  53. }
  54. }
  55. }
  56. }
  57. int main()
  58. {
  59. cin>>n;
  60. back(1);
  61. return 0;
  62. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement