[BOJ] 친구 / 실버2 / 50분

https://www.acmicpc.net/problem/1058

Author: YoonYn9915

YoonYn9915/Graph/2024-02-01-[백준]-#1058-친구.py

@@ -0,0 +1,17 @@
+n = int(input())
+friends = [list(input()) for _ in range(n)]
+
+connected = [[0] * n for _ in range(n)]
+
+for k in range(n):
+    for i in range(n):
+        for j in range(n):
+            if i == j:
+                continue
+            if friends[i][j] == "Y" or (friends[i][k] == "Y" and friends[k][j] == "Y"):
+                connected[i][j] = 1
+
+answer = 0
+for row in connected:
+    answer = max(answer, sum(row))
+print(answer)