728x90
반응형
Python
def main():
n = int(input())
# friends_list = [[False for _ in range(n)] for _ in range(n)]
friends_list = []
friends_count = []
for _ in range(n):
person = [True if v == "Y" else False for v in list(input())]
friends_list.append(person)
for i, v_list in enumerate(friends_list):
friends_index_set = set()
for index, v in enumerate(v_list):
if v:
friends_index_set.add(index)
#친구의 친구 찾기
for f_index, f_v in enumerate(friends_list[index]):#ex[False, True, False, True...]
if f_v and f_index != i:
friends_index_set.add(f_index)
friends_count.append(len(friends_index_set))
print(max(friends_count))
main()
728x90
반응형
'백준 알고리즘 > 실버' 카테고리의 다른 글
1117 색칠1 (1) | 2022.03.13 |
---|---|
1003 피보나치 함수 (0) | 2022.03.11 |
1024 수열의 합 (0) | 2022.03.09 |
1012 유기농 배추 (0) | 2022.03.08 |
1105 팔 (0) | 2022.03.07 |