Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int n,node[100][100],visit[100]= {0},c;
- int dfs(int st)
- {
- if(visit[st]==0)
- {
- visit[st]=1;
- //cout<<st+1<<endl;
- for(int i=0; i<n; i++)
- {
- if(node[st][i]==1 && visit[i]==0)
- {
- dfs(i);
- }
- }
- }
- }
- int main()
- {
- int i,j,st;
- freopen("input1.txt","r",stdin);
- cin>>n;
- for(i=0; i<n; i++)
- {
- for(j=0; j<n; j++)
- {
- cin>>node[i][j];
- }
- }
- for(j=0; j<n; j++)
- {
- visit[j]=-1;
- c=0;
- for(i=0; i<n; i++)
- {
- if(visit[i]==0)
- {
- dfs(i);
- c++;
- }
- }
- if(c>1)
- {
- cout<<j+1<<endl;
- }
- memset(visit,0,sizeof(visit));
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement