Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream fin("graf.in");
- int n, A[100][100];
- void citire_graf(int &n, int A[100][100])
- {
- int a,b;
- cin>>n;
- do
- {
- cin>>a>>b;
- A[a][b]=A[b][a]=1;
- }
- while(a&&b);
- }
- void citire_graf_fisier(int &n, int A[100][100])
- {
- int a,b;
- fin>>n;
- for(a=1; a<=n; a++)
- for(b=1; b<=n; b++)
- fin>>A[a][b];
- }
- int grad(int n, int A[100][100], int nod)
- {
- int g=0;
- for(int j=1; j<=n; j++)
- g+=A[nod][j];
- return g;
- }
- int main()
- {
- citire_graf_fisier(n,A);
- cout<<"\nPersoanele care au cei mai multi prieteni: ";
- int max=0;
- for(int i=1; i<=n; i++)
- {
- int s=0;
- for(int j=1; j<=n; j++)
- s+=A[i][j];
- if(max<s)
- max=s;
- }
- for(int i=1; i<=n; i++)
- {
- int s=0;
- for(int j=1; j<=n; j++)
- s+=A[i][j];
- if(max==s)
- cout<<i<<' ';
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement