Advertisement
Guest User

Untitled

a guest
May 24th, 2018
62
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.89 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. using namespace std;
  4. ifstream f("date.in");
  5. int n,k,a[100][100],st[100];
  6. void citire()
  7. {
  8. for(int i=1;i<=n;i++)
  9. for(int j=1;j<=n;j++)
  10. {
  11. f>>a[i][j];
  12. }
  13. }
  14. void init(int k)
  15. {
  16. st[k]=0;
  17. }
  18. int succesor(int k)
  19. {
  20. if(st[k]<1)
  21. {
  22. st[k]++;
  23. return 1;
  24. }
  25. else
  26. return 0;
  27.  
  28. }
  29. int valid(int k)
  30. {
  31. for(int i=1;i<=n;i++)
  32. if(a[st[i]][st[k]]==0)
  33. return 0;
  34. return 1;
  35. }
  36. int solutie(int k)
  37. {
  38. return k==n;
  39. }
  40. void tipar()
  41. {
  42. for(int i=0;i<=n;i++)
  43. if(st[i]==1)
  44. cout<<i<<" ";
  45. }
  46. void bt(int k)
  47. {
  48. init(k);
  49. while(succesor(k))
  50. if(valid(k))
  51. {if(solutie(k))
  52. tipar();
  53. else
  54. bt(k+1);}
  55. }
  56. int main()
  57. {
  58. f>>n;
  59. bt(1);
  60. f.close();
  61. return 0;
  62. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement