1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>

using namespace std;

void myfunc(int n) {
    
    vector<int> ans(n, INT_MAX);
    vector<vector<int>> matrix(n, vector<int>(n, 0));
    
    int tmp;
    for(int i=0; i<n; i++) {
        for(int j=0; j<n; j++) {
            cin >> tmp;
            matrix[i][j] = tmp;
        }
    }
    
    for(int p=0; p<n; p++) {
        queue<int> q;
        vector<int> distance(n, INT_MAX);
        vector<int> visit(n, 0);
        
        q.push(p); visit[p] = 1;
        distance[p] = 0;
        
        while(!q.empty()) {
            int i = q.front();
            for(int j=0; j<n; j++) {
                if(j != i && matrix[i][j] == 1 && visit[j] == 0) {
                    q.push(j);
                    visit[j] = 1;
                    distance[j] = distance[i] + 1;
                }
            }
            q.pop();
        }
        
        int maxma = 0;
        for(int &x: distance) {
            if(x == INT_MAX) {      // 距離無限大表示無法連線
                cout << "disconnected" << endl;
                return;
            }
            else if(x != 0) {     // 排除掉自己
                maxma = max(maxma, x);
            }
        }
        ans[p] = maxma;
    }
    
    int minima = *min_element(ans.begin(), ans.end());
    for(int i=0; i<n; i++) {
        if(ans[i] == minima)
            cout << i << " ";
    }
    cout << endl;
}

int main() {
    int n;
    
    while(cin >> n && n != 0) {
        myfunc(n);
    }
    

    return 0;
}