selfnum=[]
selfnums=[]
selfs=[]
for j in range(1,10000):
sum_=0
for i in str(j):
sum_+=int(i)
self=sum_+j
selfnum.append(self)
selfnum_=sorted(selfnum)
for i in range(1,10000):
selfnums.append(i)
for i in selfnums:
if i not in selfnum_:
selfs.append(i)
for i in selfs:
print(i)
'백준 문제' 카테고리의 다른 글
ATM-11399 (python) (0) | 2019.12.27 |
---|---|
상수-2908 (python) (0) | 2019.12.24 |
최댓값-2562 (python) (0) | 2019.12.24 |
숫자의 개수-2577 (python) (0) | 2019.12.24 |