Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<fstream>
- using namespace std;
- int a[101][101], n, m, v[101]
- ifstream fin("grad.in");
- ofstream fout("grad.out");
- void citire()
- {
- int x,y,i;
- fin>>n>>m;
- for(i=1;i<=n;i++)
- {
- fin>>x>>y;
- a[x][y]=1;
- a[y][x]=1;
- }
- }
- int grade(int nod)
- {
- int d,i;
- for(i=1;i<=n;i++)
- d=d+a[nod][i];
- return d;
- }
- void retin_grade()
- {
- int i;
- for(i=1;i<=n;i++)
- v[i]=grade(i);
- }
- void grad_maxim()
- {
- int maxim=0,i;
- for(i=1;i<=n;i++)
- if(v[i]>maxim)
- maxim=v[i];
- for(i=1;i<=n;i++)
- if(v[i]==maxim)
- fout<<i<<" ";
- }
- int noduri_izolate()
- {
- int i,ct=0;
- for(i=1;i<=n;i++)
- if(v[i]==0)
- ct++;
- return ct;
- }
- int noduri_gr_minim()
- {
- int i,ct=0;minim=n-1;
- for(i=1;i<=n;i++)
- if(v[i]<minim&&v[i]!=0)
- minim=v[i];
- for(i=1;i<=n;i++)
- if(v[i]==minim)
- ct++;
- return ct;
- }
- void graf_complet()
- {
- int i,s=;
- for(i=1;i<=n;i++)
- s=s+v[i];
- if(s==n*(n-1))
- fout<<"ESTE COMPLET";
- else
- fout<<"TREBUIE ADAUGATE"<<" "<<(n*(n-1)-s)/2<<"MUCHII";
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement