📃 백준 12852 1️⃣ 1로 만들기 2 DP, BFS, 그래프 https://www.acmicpc.net/problem/12852 🔷 prototype code def makeone(N): count = 0 temp = [] while N != 1: temp.append(N) if N % 3 ==1: N = N - 1 count += 1 elif N % 3 == 0: N = N // 3 count += 1 elif N % 2 == 0: N = N // 2 count += 1 else: N -= 1 count += 1 if N == 1: temp.append(N) return count, temp if __name__ == '__main__': N = int(input()) count, temp = m..