https://www.acmicpc.net/problem/4779재귀 함수def cantor(n): if n == 1: return '-' return cantor(n // 3) + ' ' * (n // 3) + cantor(n // 3)while True: try: n = int(input()) print(cantor(3 ** n)) except: break Bottom Updef cantor(n): arr = [''] * (3 ** n) arr[0] = '-' for i in range(1, n + 1): arr[i] = arr[i - 1] + ' ' * 3 ** (i - 1) + arr[i - 1] print(arr[n])while True: try: ..
전체 글
https://www.acmicpc.net/problem/10870def fibonacci(n): if n == 0 or n == 1: return n return fibonacci(n - 1) + fibonacci(n - 2)n = int(input())print(fibonacci(n))
