问题描述
123321是一个非常特殊的数,它从左边读和从右边读是一样的。
输入一个正整数n, 编程求所有这样的五位和六位十进制数,满足各位数字之和等于n 。
输入格式
输入一行,包含一个正整数n。
输出格式
按从小到大的顺序输出满足条件的整数,每个整数占一行。
样例输入
52
样例输出
899998
989989
998899
数据规模和约定
1<=n<=54
str = input()
n = int(str)
list1 =[0,0,0,0,0]
list2 =[0,0,0,0,0,0]
for i in range(1, 10):
list1[0]= i
for j in range(0, 10):
list1[1] = j
for k in range(0, 10):
list1[2] = k
for h in range(0, 10):
list1[3] = h
for g in range(0, 10):
list1[4] = g
if list1[0] == list1[4] and list1[1] == list1[3] and list1[0]+list1[1]+list1[2]+list1[3]+list1[4]==n:
for p in range(0, 5):
print(list1[p], end="")
if p == 4:
print("\t")
for i in range(1, 10):
list2[0] = i
for j in range(0, 10):
list2[1] = j
for k in range(0, 10):
list2[2] = k
for h in range(0, 10):
list2[3] = h
for g in range(0, 10):
list2[4] = g
for l in range(0, 10):
list2[5]= l
if list2[0] == list2[5] and list2[1] == list2[4] and list2[2] == list2[3] and list2[0]+list2[1]+list2[2]+list2[3]+list2[4]+list2[5]==n:
for p in range(0, 6):
print(list2[p],end="")
if p == 5:
print("\t")