SWEA 1217. 거듭제곱

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14dUIaAAUCFAYD

SW Expert Academy

 

전체 코드

# Code
def involution(n, m):
    if m < 2:
        return n

    result = n * involution(n, m - 1)
    return result

# ---- submit ----
T = 10
for test_case in range(1, T + 1):
    t_num = int(input())
    n, m = map(int, input().split(' '))

    result = involution(n, m)
    print(f'#{test_case} {result}')