손코딩에 빈출하는 사례들을 정리
Continue reading
손코딩에 빈출하는 사례들을 정리
Continue reading
손코딩에 빈출하는 사례들을 정리
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
07 Dec 2021 in Algorithm on 문제풀이 , 자료구조 , Permutation , Combination , 순열 , 조합
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
문제 Continue reading
문제 Continue reading
문제 Continue reading
문제 Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
문제 설명 빙고는 NxN 크기의 게임 보드 칸에 1부터 NxN까지의 자연수를 중복 없이 하나씩 적은 후 숫자를 하나씩 지워나가는 게임입니다. 이때, 가로, 세로, 대각선 방향으로 한 줄에 적힌 숫자를 모두 지울 경우 빙고를 1개 만들었다고 합니다. 다음은 4X4 크기의 게임 보드를 이용해 게임을 진행한 예시입니다.
Continue reading
Continue reading
문제 설명 Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading
Continue reading