๐ป ๋ฐฑ์ค 2331๋ฒ [๋ฐ๋ณต์์ด] 2331๋ฒ: ๋ฐ๋ณต์์ด ์ฒซ์งธ ์ค์ ๋ฐ๋ณต๋๋ ๋ถ๋ถ์ ์ ์ธํ์ ๋, ์์ด์ ๋จ๊ฒ ๋๋ ์๋ค์ ๊ฐ์๋ฅผ ์ถ๋ ฅํ๋ค. www.acmicpc.net ํ์ด) ์ฒซ๋ฒ์งธ ์ ์ถ : ๋ฐํ์์๋ฌ(ModuleNotFoundError) ๋ธ ์๊ณ ๋ณด๋ ๋ฐฑ์ค์์๋ numpy๋ฅผ ๋ชป ์ฐ๊ฒ ํจ...;;^^ # ์ฒซ๋ฒ์งธ import numpy as np a,p = map(int,input().split()) visited = {} stack = [] def cal(a,p) : if a in visited : return stack.pop() else : visited[a] = 1 stack.append(a) return cal(np.sum([int(i)**p for i in str(a)]),p) dup_n = cal..