首页 > 代码库 > 1005. Spell It Right (20)——PAT (Advanced Level) Practise
1005. Spell It Right (20)——PAT (Advanced Level) Practise
题目信息：
1005. Spell It Right (20)
时间限制
400 ms
内存限制
32000 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.
Input Specification:
Each input file contains one test case. Each case occupies one line which contains an N (<= 10100).
Output Specification:
For each test case, output in one line the digits of the sum in English words. There must be one space between two consecutive words, but no extra space at the end of a line.
Sample Input:12345Sample Output:
one five
代码如下：
#include <iostream>
#include <stack>
#include <iterator>
#include <algorithm>
using namespace std;
int main()
{
char *str[10] = { "zero", "one", "two", "three", "four", "five",
"six", "seven", "eight", "nine" };
unsigned int sum = 0;
char ch[101];
cin >> ch;
for (int i = 0; ch[i] != '\0'; i++)
{
sum += ch[i] - '0';
}
stack<int> res;
if (sum == 0)
res.push(0);
while (sum)
{
res.push(sum % 10);
sum /= 10;
}
cout << str[res.top()];
res.pop();
while (!res.empty())
{
cout << " " << str[res.top()];
res.pop();
}
cout << endl;
return 0;
}1005. Spell It Right (20)——PAT (Advanced Level) Practise
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。