Advertisement
Guest User

Untitled

a guest
Jan 21st, 2020
124
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.01 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. using namespace std;
  4. ifstream fin("graf.in");
  5. int n, A[100][100];
  6. void citire_graf(int &n, int A[100][100])
  7. {
  8. int a,b;
  9. cin>>n;
  10. do
  11. {
  12. cin>>a>>b;
  13. A[a][b]=A[b][a]=1;
  14. }
  15. while(a&&b);
  16. }
  17. void citire_graf_fisier(int &n, int A[100][100])
  18. {
  19. int a,b;
  20. fin>>n;
  21. for(a=1; a<=n; a++)
  22. for(b=1; b<=n; b++)
  23. fin>>A[a][b];
  24. }
  25.  
  26. int grad(int n, int A[100][100], int nod)
  27. {
  28. int g=0;
  29. for(int j=1; j<=n; j++)
  30. g+=A[nod][j];
  31. return g;
  32. }
  33. int main()
  34. {
  35. citire_graf_fisier(n,A);
  36. cout<<"\nPersoanele care au cei mai multi prieteni: ";
  37. int max=0;
  38. for(int i=1; i<=n; i++)
  39. {
  40. int s=0;
  41. for(int j=1; j<=n; j++)
  42. s+=A[i][j];
  43. if(max<s)
  44. max=s;
  45. }
  46. for(int i=1; i<=n; i++)
  47. {
  48. int s=0;
  49. for(int j=1; j<=n; j++)
  50. s+=A[i][j];
  51. if(max==s)
  52. cout<<i<<' ';
  53. }
  54. return 0;
  55. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement