Advertisement
Five_NT

[C++]Grup prieteni +/- vecini

Dec 12th, 2013
91
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.49 KB | None | 0 0
  1. /* *************************************************************************************************************************************
  2. *  Dintr-un grup de n persoane s-au stabilit relatii de pretenie de vecinatate. Determinati grupurile de prieteni, gupurile de vecini. *
  3. ************************************************************************************************************************************** */
  4. #include<iostream>
  5. #include<fstream>
  6.  
  7. using namespace std;
  8.  
  9. int a[50][50],b[50][50], n, i, j;
  10.  
  11. void citire();
  12. void prg1();
  13. void prg2();
  14. void prg3();
  15.  
  16. int main()
  17. {
  18.     citire();
  19.     cout<<"* Prieteni:"<<'\n';
  20.     prg1();
  21.     cout<<'\n'<<"* Vecini:"<<'\n';
  22.     prg2();
  23.     cout<<'\n'<<"** Prieteni & Vecini:"<<'\n';
  24.     prg3();
  25.     return 0;
  26. }
  27.  
  28. void citire()
  29. {
  30.     ifstream f("citire.in");
  31.     f>>n;
  32.     for(i=1; i<=n; i++)
  33.         for(j=1; j<=n; j++)
  34.             f>>a[i][j];
  35.     for(i=1; i<=n; i++)
  36.         for(j=1; j<=n; j++)
  37.             f>>b[i][j];
  38. }
  39. void prg1()
  40. {
  41.     for(i=1; i<n; i++)
  42.         for(j=i+1; j<=n; j++)
  43.             if(b[i][j]==1)
  44.                 cout<<i<<" - "<<j<<'\n';
  45.                
  46. }
  47. void prg2()
  48. {
  49.     for(i=1; i<n; i++)
  50.         for(j=i+1; j<=n; j++)
  51.             if(a[i][j]==1)
  52.                 cout<<i<<" - "<<j<<'\n';
  53. }
  54. void prg3()
  55. {
  56.     for(i=1; i<n; i++)
  57.         for(j=i+1; j<=n; j++)
  58.             if(a[i][j]==1 && b[i][j]==1)
  59.                 cout<<i<<" - "<<j<<'\n';
  60. }
  61. /* citire.in */
  62. 7
  63. 0 1 0 1 0 0 1
  64. 1 0 1 0 0 0 0
  65. 0 1 0 1 0 0 0
  66. 1 0 1 0 1 0 0
  67. 0 0 0 1 0 1 0
  68. 0 0 0 0 1 0 1
  69. 1 0 0 0 0 1 0
  70. 0 0 1 1 1 0 0
  71. 0 0 0 0 0 1 0
  72. 1 0 0 0 0 0 0
  73. 1 0 0 0 0 0 0
  74. 1 0 0 0 0 0 1
  75. 0 1 0 0 0 0 0
  76. 0 0 0 0 1 0 1
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement