蓝桥杯试题 基础练习 数的读法
Tom教授正在给研究生讲授一门关于基因的课程,有一件事情让他颇为头疼:一条染色体上有成千上万个碱基对,它们从0开始编号,到几百万,几千万,甚至上亿。比如说,在对学生讲解第1234567009号位置上的碱基时,光看着数字是很难准确的念出来的。所以,他迫切地需要一个系统,然后当他输入12 3456 7009时,会给出相应的念法:十二亿三千四百五十六万七千零九
用汉语拼音表示为
shi er yi san qian si bai wu shi liu wan qi qian ling jiu
这样他只需要照着念就可以了。
你的任务是帮他设计这样一个系统:给定一个阿拉伯数字串,你帮他按照中文读写的规范转为汉语拼音字串,相邻的两个音节用一个空格符格开。
注意必须严格按照规范,比如说“10010”读作“yi wan ling yi shi”而不是“yi wan ling shi”,“100000”读作“shi wan”而不是“yi shi wan”,“2000”读作“er qian”而不是“liang qian”。
输入:有一个数字串,数值大小不超过2,000,000,000。
输出:是一个由小写英文字母,逗号和空格组成的字符串,表示该数的英文读法。
样例输入:1234567009
样例输出:shi er yi san qian si bai wu shi liu wan qi qian ling jiu
首先判断输入的串的位数,根据位数分为三类,第一类是大于8位,第二类是大于4位并且小于9位,第三类是小于5位,读的时候分为三个级别,个级、万级、亿级,分别写三个函数。这里说一下第一个难点是每个级别的两位数的读法,分为四种情况,这里以个级别为例,
if ge[0]==1: #高位为1的情况,读的时候应该读shi
if ge[1]==0: #低位的0不读
return(n_2[0])
else: #其他情况
return(n_2[0]+' '+n_1[ge[1]])
else: #其他情况
if ge[1]==0: #低位的0不读
return(n_1[ge[0]]+' '+n_2[0])
else: #其他情况
return(n_1[ge[0]]+' '+n_2[0]+' '+n_1[ge[1]])
#试题 基础练习 数的读法
n_1=['ling','yi','er','san','si','wu','liu','qi','ba','jiu']
n_2=['shi','bai','qian','wan','yi']
def reader_ge(ge):
ge=list(map(int,ge))
if len(ge) == 4:
if ge[0]==0:
if ge[1]==0 and ge[2]==0 and ge[3]==0:
return('')
elif ge[1]==0 and ge[2]==0 and ge[3]!=0:
return(n_1[ge[1]]+' '+n_1[ge[3]])
elif ge[1]==0 and ge[2]!=0 and ge[3]==0:
return(n_1[ge[1]]+' '+n_1[ge[2]]+' '+n_2[0])
elif ge[1]==0 and ge[2]!=0 and ge[3]!=0:
return(n_1[ge[1]]+' '+n_1[ge[2]]+' '+n_2[0]+' '+n_1[ge[3]])
elif ge[1]!=0 and ge[2]==0 and ge[3]==0:
return(n_1[ge[0]]+' '+n_1[ge[1]]+' '+n_2[1])
elif ge[1]!=0 and ge[2]==0 and ge[3]!=0:
return(n_1[ge[0]]+' '+n_1[ge[1]]+' '+n_2[1]+' '+n_1[ge[2]]+' '+n_1[ge[3]])
elif ge[1]!=0 and ge[2]!=0 and ge[3]==0:
return(n_1[ge[0]]+' '+n_1[ge[1]]+' '+n_2[1]+' '+n_1[ge[2]]+' '+n_2[0])
else:
return(n_1[ge[0]]+' '+n_1[ge[1]]+' '+n_2[1]+' '+n_1[ge[2]]+' '+n_2[0]+' '+n_1[ge[3]])
else:
if ge[1]==0 and ge[2]==0 and ge[3]==0:
return(n_1[ge[0]]+' '+n_2[2])
elif ge[1]==0 and ge[2]==0 and ge[3]!=0:
return(n_1[ge[0]]+' '+n_2[2]+' '+n_1[ge[1]]+' '+n_1[ge[3]])
elif ge[1]==0 and ge[2]!=0 and ge[3]==0:
return(n_1[ge[0]]+' '+n_2[2]+' '+n_1[ge[1]]+' '+n_1[ge[2]]+' '+n_2[0])
elif ge[1]==0 and ge[2]!=0 and ge[3]!=0:
return(n_1[ge[0]]+' '+n_2[2]+' '+n_1[ge[1]]+' '+n_1[ge[2]]+' '+n_2[0]+' '+n_1[ge[3]])
elif ge[1]!=0 and ge[2]==0 and ge[3]==0:
return(n_1[ge[0]]+' '+n_2[2]+' '+n_1[ge[1]]+' '+n_2[1])
elif ge[1]!=0 and ge[2]==0 and ge[3]!=0:
return(n_1[ge[0]]+' '+n_2[2]+' '+n_1[ge[1]]+' '+n_2[1]+' '+n_1[ge[2]]+' '+n_1[ge[3]])
elif ge[1]!=0 and ge[2]!=0 and ge[3]==0:
return(n_1[ge[0]]+' '+n_2[2]+' '+n_1[ge[1]]+' '+n_2[1]+' '+n_1[ge[2]]+' '+n_2[0])
else:
return(n_1[ge[0]]+' '+n_2[2]+' '+n_1[ge[1]]+' '+n_2[1]+' '+n_1[ge[2]]+' '+n_2[0]+' '+n_1[ge[3]])
elif len(ge) == 3:
if ge[1] == 0 and ge[2] == 0:
return(n_1[ge[0]]+' '+n_2[1])
elif ge[1] == 0 and ge[2] !=0:
return(n_1[ge[0]]+' '+n_2[1]+' '+n_1[ge[1]]+' '+n_1[ge[2]])
elif ge[1]!=0 and ge[2]==0:
return(n_1[ge[0]]+' '+n_2[1]+' '+n_1[ge[1]]+' '+n_2[0])
else:
return(n_1[ge[0]]+' '+n_2[1]+' '+n_1[ge[1]]+' '+n_2[0]+' '+n_1[ge[2]])
elif len(ge) == 2:
if ge[0]==1:
if ge[1]==0:
return(n_2[0])
else:
return(n_2[0]+' '+n_1[ge[1]])
else:
if ge[1]==0:
return(n_1[ge[0]]+' '+n_2[0])
else:
return(n_1[ge[0]]+' '+n_2[0]+' '+n_1[ge[1]])
else:
return(n_1[ge[0]])
def reader_wan(wan,ge):
wan=list(map(int,wan))
ge=list(map(int,ge))
if len(wan) == 4:
if wan[0]==0:
if wan[1]==0 and wan[2]==0 and wan[3]==0:
if ge[0]!=0:
return('ling')
else:
return('')
elif wan[1]==0 and wan[2]==0 and wan[3]!=0:
return(n_1[wan[0]]+' '+n_1[wan[3]]+' '+n_2[3])
elif wan[1]==0 and wan[2]!=0 and wan[3]==0:
return(n_1[wan[0]]+' '+n_1[wan[2]]+' '+n_2[0]+' '+n_2[3])
elif wan[1]==0 and wan[2]!=0 and wan[3]!=0:
return(n_1[wan[0]]+' '+n_1[wan[2]]+' '+n_2[0]+' '+n_1[wan[3]]+' '+n_2[3])
elif wan[1]!=0 and wan[2]==0 and wan[3]==0:
return(n_1[wan[0]]+' '+n_1[wan[1]]+' '+n_2[1]+' '+n_2[3])
elif wan[1]!=0 and wan[2]==0 and wan[3]!=0:
return(n_1[wan[0]]+' '+n_1[wan[1]]+' '+n_2[1]+' '+n_1[wan[2]]+' '+n_1[wan[3]]+' '+n_2[3])
elif wan[1]!=0 and wan[2]!=0 and wan[3]==0:
return(n_1[wan[0]]+' '+n_1[wan[1]]+' '+n_2[1]+' '+n_1[wan[2]]+' '+n_2[0]+' '+n_2[3])
else:
return(n_1[wan[0]]+' '+n_1[wan[1]]+' '+n_2[1]+' '+n_1[wan[2]]+' '+n_2[0]+' '+n_1[wan[3]]+' '+n_2[3])
else:
if wan[1]==0 and wan[2]==0 and wan[3]==0:
return(n_1[wan[0]]+' '+n_2[2]+' '+n_2[3])
elif wan[1]==0 and wan[2]==0 and wan[3]!=0:
return(n_1[wan[0]]+' '+n_2[2]+' '+n_1[wan[1]]+' '+n_1[wan[3]]+' '+n_2[3])
elif wan[1]==0 and wan[2]!=0 and wan[3]==0:
return(n_1[wan[0]]+' '+n_2[2]+' '+n_1[wan[1]]+' '+n_1[wan[2]]+' '+n_2[0]+' '+n_2[3])
elif wan[1]==0 and wan[2]!=0 and wan[3]!=0:
return(n_1[wan[0]]+' '+n_2[2]+' '+n_1[wan[1]]+' '+n_1[wan[2]]+' '+n_2[0]+' '+n_1[wan[3]]+' '+n_2[3])
elif wan[1]!=0 and wan[2]==0 and wan[3]==0:
return(n_1[wan[0]]+' '+n_2[2]+' '+n_1[wan[1]]+' '+n_2[1]+' '+n_2[3])
elif wan[1]!=0 and wan[2]==0 and wan[3]!=0:
return(n_1[wan[0]]+' '+n_2[2]+' '+n_1[wan[1]]+' '+n_2[1]+' '+n_1[wan[2]]+' '+n_1[wan[3]]+' '+n_2[3])
elif wan[1]!=0 and wan[2]!=0 and wan[3]==0:
return(n_1[wan[0]]+' '+n_2[2]+' '+n_1[wan[1]]+' '+n_2[1]+' '+n_1[wan[2]]+' '+n_2[0]+' '+n_2[3])
else:
return(n_1[wan[0]]+' '+n_2[2]+' '+n_1[wan[1]]+' '+n_2[1]+' '+n_1[wan[2]]+' '+n_2[0]+' '+n_1[wan[3]]+' '+n_2[3])
elif len(wan) == 3:
if wan[1] == 0 and wan[2] == 0:
return(n_1[wan[0]]+' '+n_2[1]+' '+n_2[3])
elif wan[1] == 0 and wan[2] !=0:
return(n_1[wan[0]]+' '+n_2[1]+' '+n_1[wan[1]]+' '+n_1[wan[2]]+' '+n_2[3])
elif ge[1]!=0 and ge[2]==0:
return(n_1[ge[0]]+' '+n_2[1]+' '+n_1[ge[1]]+' '+n_2[0]+' '+n_2[3])
else:
return(n_1[wan[0]]+' '+n_2[1]+' '+n_1[wan[1]]+' '+n_2[0]+' '+n_1[wan[2]]+' '+n_2[3])
elif len(wan) == 2:
if wan[0]==1:
if wan[1]==0:
return(n_2[0]+' '+n_2[3])
else:
return(n_2[0]+' '+n_1[wan[1]]+' '+n_2[3])
else:
if wan[1]==0:
return(n_1[wan[0]]+' '+n_2[0]+' '+n_2[3])
else:
return(n_1[wan[0]]+' '+n_2[0]+' '+n_1[wan[1]]+' '+n_2[3])
else:
return(n_1[wan[0]]+' '+n_2[3])
def reader_yi(yi):
yi=list(map(int,yi))
if len(yi) == 4:
if yi[1]==0 and yi[2]==0 and yi[3]==0:
return(n_1[yi[0]]+' '+n_2[2]+' '+n_2[4])
elif yi[1]==0 and yi[2]==0 and yi[3]!=0:
return(n_1[yi[0]]+' '+n_2[2]+' '+n_1[yi[1]]+' '+n_1[yi[3]]+' '+n_2[4])
elif yi[1]==0 and yi[2]!=0 and yi[3]==0:
return(n_1[yi[0]]+' '+n_2[2]+' '+n_1[yi[1]]+' '+n_1[yi[2]]+' '+n_2[0]+' '+n_2[4])
elif yi[1]==0 and yi[2]!=0 and yi[3]!=0:
return(n_1[yi[0]]+' '+n_2[2]+' '+n_1[yi[1]]+' '+n_1[yi[2]]+' '+n_2[0]+' '+n_1[yi[3]]+' '+n_2[4])
elif yi[1]!=0 and yi[2]==0 and yi[3]==0:
return(n_1[yi[0]]+' '+n_2[2]+' '+n_1[yi[1]]+' '+n_2[1]+' '+n_2[4])
elif yi[1]!=0 and yi[2]==0 and yi[3]!=0:
return(n_1[yi[0]]+' '+n_2[2]+' '+n_1[yi[1]]+' '+n_2[1]+' '+n_1[yi[2]]+' '+n_1[yi[3]]+' '+n_2[4])
elif yi[1]!=0 and yi[2]!=0 and yi[3]==0:
return(n_1[yi[0]]+' '+n_2[2]+' '+n_1[yi[1]]+' '+n_2[1]+' '+n_1[yi[2]]+' '+n_2[0]+' '+n_2[4])
else:
return(n_1[yi[0]]+' '+n_2[2]+' '+n_1[yi[1]]+' '+n_2[1]+' '+n_1[yi[2]]+' '+n_2[0]+' '+n_1[yi[3]]+' '+n_2[4])
elif len(yi) == 3:
if yi[1] == 0 and yi[2] == 0:
return(n_1[yi[0]]+' '+n_2[1]+' '+n_2[4])
elif yi[1] == 0 and yi[2] !=0:
return(n_1[yi[0]]+' '+n_2[1]+' '+n_1[yi[1]]+' '+n_1[yi[2]]+' '+n_2[4])
elif yi[1]!=0 and yi[2]==0:
return(n_1[yi[0]]+' '+n_2[1]+' '+n_1[yi[1]]+' '+n_2[0]+' '+n_2[4])
else:
return(n_1[yi[0]]+' '+n_2[1]+' '+n_1[yi[1]]+' '+n_2[0]+' '+n_1[yi[2]]+' '+n_2[4])
elif len(yi) == 2:
if yi[0]==1:
if yi[1]==0:
return(n_2[0]+' '+n_2[4])
else:
return(n_2[0]+' '+n_1[yi[1]]+' '+n_2[4])
else:
if yi[1]==0:
return(n_1[yi[0]]+' '+n_2[0]+' '+n_2[4])
else:
return(n_1[yi[0]]+' '+n_2[0]+' '+n_1[yi[1]]+' '+n_2[4])
else:
return(n_1[yi[0]]+' '+n_2[4])
a=list(input().strip())
if len(a) > 8:
ge=a[-4::]
wan=a[-8:-4:1]
yi=a[0:-8:1]
print(reader_yi(yi)+' '+reader_wan(wan,ge)+' '+reader_ge(ge))
elif len(a) >4 and len(a) <9:
ge=a[-4::]
wan=a[0:-4:1]
print(reader_wan(wan,ge)+' '+reader_ge(ge))
else:
ge=a
print(reader_ge(ge))