Advertisement
Guest User

Untitled

a guest
Feb 24th, 2020
96
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.82 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3.  
  4. using namespace std;
  5.  
  6. int d[10]={0};
  7.  
  8. void citire(int a[][100],int &n)
  9. {
  10. ifstream fin("date.in");
  11. fin>>n;
  12. for(int i=1;i<=n;i++)
  13. for(int j=1;j<=n;j++)
  14. fin>>a[i][j];
  15. fin.close();
  16. }
  17.  
  18. void transpusa(int a[][100],int n,int b[][100])
  19. {
  20. for(int i=1;i<=n;i++)
  21. for(int j=1;j<=n;j++)
  22. b[i][j]=a[j][i];
  23. }
  24.  
  25. void drum(int a[][100],int n)
  26. {
  27. for(int i=1;i<=n;i++)
  28. for(int j=1;j<=n;j++)
  29. for(int k=1;k<=n;k++)
  30. if(a[i][j]==0)
  31. if(i!=k && j!=k)
  32. a[i][j]=a[i][k]*a[k][j];
  33.  
  34. }
  35.  
  36. void intersectie(int a[][100],int b[][100],int n,int c[][100])
  37. {
  38. for(int i=1;i<=n;i++)
  39. for(int j=1;j<=n;j++)
  40. c[i][j]=a[i][j]*b[i][j];
  41. }
  42.  
  43. void afisare(int c[][100],int n)
  44. {
  45. int cc=1;
  46. for(int i=2;i<=n;i++)
  47. for(int j=1; j<=n; j++)
  48. {
  49. if(c[i][j]!=c[i-1][j])
  50. if(c[i][j]==1)
  51. {
  52. d[j]=cc;
  53. }
  54. if(j==n)
  55. cc++;
  56. }
  57. //
  58. // for(int i=1; i<=n; i++)
  59. // cout<<d[i]<<" ";
  60.  
  61.  
  62.  
  63. while(!semn)
  64. {for(int i=1; i<=n; i++)
  65. {
  66. if(d[i]!=0)
  67. {
  68. cout<<i<<" ";
  69.  
  70. for(int j=i+1; j<=n; j++)
  71. {
  72. if(d[j]==d[i])
  73. cout<<j<<" ";
  74. d[j]=0;
  75. }
  76. d[i]=0;
  77. }
  78.  
  79. }}
  80. }
  81.  
  82. int main()
  83. {
  84. int a[100][100],b[100][100],c[100][100],n;
  85. citire(a,n);
  86. transpusa(a,n,b);
  87. drum(a,n);
  88. drum(a,n);
  89. //afisare(a,n);
  90. drum(b,n);
  91. drum(b,n);
  92. intersectie(a,b,n,c);
  93. afisare(c,n);
  94.  
  95. return 0;
  96. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement