PAT甲级真题 1005 Spell It Right (20分) C++实现（感觉只值15分吧）

最新推荐文章于 2025-12-15 09:15:21 发布

原创最新推荐文章于 2025-12-15 09:15:21 发布 · 160 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #算法

PAT 专栏收录该内容

209 篇文章

订阅专栏

本文介绍了一种算法，用于计算一个非负整数的所有位数之和，并将该和的每一位数字转换成英文单词输出。通过将数字存储为字符串，逐位计算数字之和，再将总和转化为字符串，最后输出每一位对应的英文单词。

题目

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:
12345
Sample Output:
one five

思路

用string存储该数字，将字符对应数字相加得出sum，用to_string()将sum转为string，逐位输出对应单词即可。

代码

#include <iostream>
using namespace std;

int main(){
    const string word[10] = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};
    string s;
    cin >> s;
    int sum = 0;
    for (int i=0; i<s.size(); i++){
        sum += (s[i] - 48);
    }
    s = to_string(sum);
    cout << word[s[0]-48];
    for (int i=1; i<s.size(); i++){
        cout << " " << word[s[i]-48];
    }
    cout << endl;
    return 0;
}