Untitled
plain_text
a month ago
771 B
8
Indexable
Never
#include<iostream> using namespace std; int TC, N, a[20][20], maxr, maxi, v[20]; void dfs(int k, int id) { v[k] = 1; for(int i = 0; i < N; i++) { if(i != id && a[k][i] == 1 && v[i] == 0) { dfs(i, id); } } } int doing(int id) { int co = 0; fill_n(v, N, 0); for(int i = 0; i < N; i++) { if(i != id && v[i] == 0) { dfs(i, id); co++; } } return co; } int main() { /*freopen("input.txt", "r", stdin);*/ cin >> TC; for(int tc = 1; tc <= TC; tc++) { cin >> N; for(int i = 0; i < N; i++) for(int j = 0; j < N; j++) cin >> a[i][j]; maxr = 1, maxi = -1; for(int i = 0; i < N; i++) { int r = doing(i); if(r > maxr) { maxr = r; maxi = i; } } cout << maxi + 1 << endl; } return 0; }