30851 백준 3085 사탕 게임 import sys input = sys.stdin.readline answer = 1 num = int(input()) num_list = [list(input()) for _ in range(num)] def find_max_count() : global answer for i in range(num) : count = 1 for j in range(1,num) : if num_list[i][j] == num_list[i][j-1] : count += 1 answer = max(answer, count) else : count = 1 for j in range(num) : count = 1 for i in range(1,num) : if num_list[i][j] == num_list[i-1][j] .. 2022. 6. 13. 이전 1 다음
