[백준 알고리즘] 4673번 Python

문제 정보

 

제출 코드

def selfNum(num):
	tmp = str(num)
	total = 0
	for s in tmp:
		total += int(s)
	return num+total

n = 1
self_num = []
while(True):
	tmp = selfNum(n)
	self_num.append(tmp)
	if(n>10000):
		break
	n += 1

self_num = list(set(self_num))
for i in range(1, 10000):
	try:
		self_num.index(i)
	except:
		print(i)