【Pat】甲级1005 - Spell It Right（STL

本文介绍了一种通过编程实现将一个非负整数的各位数字相加，并将求和结果用英文单词形式输出的方法。使用C++语言实现，涉及字符串转换、栈与映射等数据结构。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 (<= 10¹⁰⁰).

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:

Sample Output:

one five

题意：输入一串数字，相加，如上和为15，则输出one five；若为27，则输出two seven。

#include<stack>
#include<stdio.h>
#include<map>
#include<string>	//下面string类型头文件，不是string.h 
#include<iostream>
using namespace std;  
int main()  
{  
    map<int,string> d;//注意<>中的类型，分别与下边数字和单词的类型对应  
    d[0] = "zero";  
    d[1] = "one";  
    d[2] = "two";  
    d[3] = "three";  
    d[4] = "four";  
    d[5] = "five";  
    d[6] = "six";  
    d[7] = "seven";  
    d[8] = "eight";  
    d[9] = "nine";  
    string num;  
    cin >> num;  
    int sum = 0;  
    for (int i = 0 ; i < num.size() ; i++)  
        sum += num[i] - '0';  
    stack<int> S;  
    if (sum == 0)       //记得这个特判  
    {  
        cout << d[0] << endl;  
        return 0;  
    }  
    while (sum)  
    {  
        S.push(sum%10);  
        sum /= 10;  
    }  
    while (!S.empty())  
    {  
        cout << d[S.top()] << (S.size() == 1 ? '\n' : ' ');  
        S.pop();  
    }  
    return 0;  
}