题目:
Back Home
1000ms 65536K
描述:
There are N cities in the graph. Given the edges between the cities. Can you find a path from city 1 to city N?
输入:
First line: one positive integers N (N <= 100).
Next N lines: an N*N 0/1 matrix A={a[i][j]}, indicating whether there exists an edge between city i and city j (a[i][j]=1) or not (a[i][j]=0).
输出:
One integer, 1 if there exists a path, or 0 otherwise.
样例输入:
4 0 1 1 0 1 0 0 1 1 0 0 0 0 1 0 0
样例输出:
1
翻译:
描述:
在图中有N个城市,给出城市之间的边缘,你能找出从城市1到城市N的路径吗?
输入:
第一行:一个正整数N(N<=100).
接下来的N行:一个N*N 0/1的矩阵A={a[i][j]},,表示在城市i和城市j之间是否存在一个边(a[i][j]=1 a[i][j]=0)
输出:
一个整数,如果存在一个路径,为1,否则为0.
样例输入:
4
0 1 1 0
1 0 0 1
1 0 0 0
0 1 0 0
样例输出:
1