Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- ifstream f("bazine.in");
- ofstream g("componenteconexe.in");
- int v[105],n,a[105][105],vec[105],nr1;
- void dfs(int nod)
- {
- v[nod]=1;
- vec[nr1]=nod;
- nr1++;
- for(int k=1;k<=n;k++)
- if(a[nod][k]==1 && v[k]==0)
- dfs(k);
- }
- int main()
- {
- int m,x,y,nr=0;
- f>>n;
- while(f>>x>>y)
- a[x][y]=a[y][x]=1;
- for(int i=1;i<=n;i++)
- {
- if(v[i]==0)
- {
- dfs(i);
- nr++;
- }
- }
- cout<<nr<<endl;
- for(int i=1;i<=n;i++)
- v[i]=0;
- for(int i=1;i<=n;i++)
- {
- nr1=1;
- if(v[i]==0)
- {
- dfs(i);
- sort(vec+1,vec+nr1+1);
- for(int j=1;j<nr1;j++)
- cout<<vec[j]<<" ";
- cout<<endl;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement