Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #include <algorithm>
- #include <bits/stdc++.h>
- using namespace std;
- int q[101],a[101][101],p,u,viz[101],n,m,lorena,anca;
- void citire()
- {
- cin>>n>>m;
- int x,y;
- for(int i=1; i<=m; i++)
- {
- cin>>x>>y;
- a[x][y]=1;
- }
- }
- void bfs(int start)
- {
- q[1]=start;
- viz[start]=1;
- p=u=1;
- while(p<=u)
- {
- int x=q[p];
- p++;
- for(int i=1; i<=n; i++)
- if(a[x][i] and viz[i]==0)
- {
- q[++u]=i;
- viz[i]=1;
- }
- }
- }
- int main()
- {
- citire();
- int ok=0;
- for(int i=1; i<=n; i++)
- {
- bfs(i);
- ok=1;
- for(int j=1; j<=n; j++)
- if(viz[j]==0)
- ok=0;
- if(ok==1)
- cout<<i<<" ";
- for(int j=1;j<=n;j++)
- viz[j]=0;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement