Depth Search#4000
The undirected unweighted graph with one selected vertex is given. Find the number of vertices in the connected component containing the selected vertex (including the selected vertex itself).
The first line contains the number of vertices and the selected vertex s~(1 \le s \le n \le 100). The next lines contain integers each — the adjacency matrix of a graph, where means the absence of an edge, and means the presence of an edge. It is guaranteed that the main diagonal of the matrix contains zeros.
Print the desired number of vertices.
Example 1
Example 5