Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int a[101][101],k=1;
- int n;
- bool t[101];
- void dfs(int s){
- int r;
- t[s]=true;
- for(r=0;r<n;r++){
- if(a[s][r]==1 && t[r]==false){
- dfs(r);
- k++;
- }
- }
- }
- int main (){
- int i,j,s;
- cin >>n >>s;
- for(i=0;i<n;i++){
- t[i]=false;
- for(j=0;j<n;j++){
- cin >>a[i][j];
- }
- }
- dfs(s-1);
- cout <<k;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement