Advertisement
Guest User

Untitled

a guest
May 24th, 2018
80
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 <fstream>
  3.  
  4. using namespace std;
  5.  
  6. ifstream f("data.in")
  7.  
  8. int n, k;
  9.  
  10. int citire()
  11. {
  12. for(int i=1; i<=n, i++)
  13. for(int j=1; j<=n; j++)
  14. f>>a[i][j];
  15. }
  16.  
  17. void init(int k)
  18. {
  19. s[k]=0;
  20. }
  21.  
  22. int succesor(int k)
  23. {
  24. if(s[k]<1)
  25. {
  26. s[k]++;
  27. return 1;
  28. }
  29. else
  30. return 0;
  31. }
  32.  
  33. int valid(int k)
  34. {
  35. for(int i=1; i<=n; i++)
  36. if(a[st[i]], st[k]==0)
  37. return 0;
  38. return 1;
  39. }
  40.  
  41. void tipar()
  42. {
  43. for(int i=1; i<=n; i++)
  44. if(st[i]==1)
  45. cout<<i;
  46. cout<<endl;
  47. }
  48.  
  49. int solutie(int k)
  50. {
  51. if(n==k)
  52. return 1;
  53. return 0;
  54. }
  55.  
  56. void BT()
  57. {
  58. init(k);
  59. while(succesor(k))
  60. {
  61. if(valid(k))
  62. if(solutie(k))
  63. tipar();
  64. else
  65. bt(k+1);
  66. }
  67. }
  68.  
  69. int main()
  70. {
  71. cin>>n;
  72. citire();
  73. bt(0, n);
  74. return 0;
  75. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement