Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #define N 101
- using namespace std;
- int k,m,n,a[N][N],pf[N],ps[N];
- void citire()
- {
- int x,y;
- cin>>n>>m>>k;
- for(int i=1;i<=m;++i)
- cin>>x>>y,a[x][y]=1;
- }
- void dfsuc(int nod)
- {
- pf[nod]=1;
- for(int k=1;k<=n;++k)
- if(a[nod][k]==1&&pf[k]==0)
- dfsuc(k);
- }
- void dfpred(int nod)
- {
- ps[nod]=1;
- for(int k=1;k<=n;++k)
- if(a[k][nod]==1&&ps[k]==0)
- dfpred(k);
- }
- int main()
- {
- citire();
- dfsuc(k);
- dfpred(k);
- for(int i=1;i<=n;++i)
- if(pf[i]*ps[i]==0)
- pf[i]=ps[i]=0;
- int sol=0;
- for(int i=1;i<=n;++i)
- if(pf[i])
- ++sol;
- cout<<sol;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement