#include<cstdio>
#include<stack>
using namespace std;
int main(){
char n[101];
char words[10][10]={"zero","one","two","three","four","five","six","seven","eight","nine"};//数字与单词对应
int sum=0;//n的各位和
stack<char *> st;//用栈实现高位先输出
scanf("%s",n);
for(int i=0;n[i]!='\0';i++){//累加各位和
sum+=n[i]-'0';
}
do{
st.push(words[sum%10]);//从低位到高位将对应的单词入栈
sum/=10;
}while(sum);
while(!st.empty()){
printf("%s",st.top());//从高位开始输出单词
st.pop();
if(!st.empty()) printf(" ");//最后一个单词后不输出空格
}
return 0;
}
PAT A1005 Spell It Right
最新推荐文章于 2022-04-16 22:39:24 发布