Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include<fstream>
- using namespace std;
- ifstream f("matrice.in");
- int main()
- { int n,i,j,a[100][100], nr=0, ok=0, minn,maxx,x=0,y=0,p1,p2;
- f>>n;
- for(i=1;i<=n;i++)
- for(j=1;j<=n;j++)
- f>>a[i][j];
- ///a)
- for(i=1;i<=n;i++)
- {nr=0;
- for(j=1;j<=n;j++)
- if(a[i][j]==0&&a[j][i]==1)
- nr++;
- if(nr==n-1)
- {
- cout<<i<<" celebritate"<<endl;
- ok=1;
- }}
- if(ok==0)
- {for(i=1;i<=n;i++)
- {x=0;y=0;
- for(j=1;j<=n;j++)
- if(a[i][j]==1)
- x++;
- if(i==1)
- {minn=x;
- p1=i;}
- else
- if(minn>=x)
- {minn=x;
- p1=i;}
- for(j=1;j<=n;j++)
- if(a[j][i]==1)
- y++;
- if(i==1)
- {
- maxx=y;
- p2=i;
- }
- else
- if(maxx<=y)
- {
- maxx=y;
- p2=i;
- }
- }
- cout<<"persoana care cunoaste cele mai putine persoane este"<<p1<<endl;
- cout<<"persoana cunoscuta de cele mai multe persoane"<<p2<<endl;
- }
- ///b)
- ok=0;
- for(i=1;i<=n;i++)
- {nr=0;
- for(j=1;j<=n;j++)
- if(a[i][j]==1&&a[j][i]==0)
- nr++;
- if(nr==n-1)
- {cout<<i<<"necunoscut";
- ok==1;}}
- if(ok==0)
- {for(i=1;i<=n;i++)
- {x=0;y=0;
- for(j=1;j<=n;j++)
- if(a[i][j]==1)
- x++;
- if(i==1)
- {maxx=x;
- p1=i;}
- else
- if(maxx<=x)
- {maxx=x;
- p1=i;}
- for(j=1;j<=n;j++)
- if(a[j][i]==1)
- y++;
- if(i==1)
- {
- minn=y;
- p2=i;
- }
- else
- if(minn>=y)
- {
- minn=y;
- p2=i;
- }
- }
- cout<<"persoana care cunoaste cele mai multe persoane este"<<p1<<endl;
- cout<<"persoana cunoscuta de cele mai putine persoane"<<p2<<endl;
- }
- ///c)
- for(i=1;i<=n;i++)
- {nr=0;
- for(j=1;j<=n;j++)
- if(a[i][j]==1||a[j][i]==1)
- nr++;
- if(nr==1)
- cout<<"siguratici:"<<i<<' ';
- ///d)
- if(nr==0)
- cout<<"straini de grup:"<<i<<' ';
- }
- cout<<endl;
- ///e)
- x=0;y=0;ok==0;
- for(i=1;i<=n;i++)
- {x=0;y=0;
- for(j=1;j<=n;j++)
- {if(a[i][j]==1)
- x++;
- if(a[j][i]==1)
- y++;}
- if(x==2&&y==3)
- {cout<<"Nodurile cu gradul intern 3 si cel exterior 2 sunt:"<<i<<' ';
- ok=1;}}
- if(ok==0)
- cout<<"Nu exista noduri cu gradul intern 3 si cel exterior 2";
- return 0;
- }
- ///Tag, succes!
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement