PTA 甲级 1005 Spell It Right（C++）

准大二小白在学技术的同时每天至少一道算法题，以此督促自己，共勉！

1005 Spell It Right

分数 20

全屏浏览题目

切换布局

作者 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:

12345

Sample Output:

one five

代码长度限制

16 KB

时间限制

400 ms

内存限制

64 MB

​
#include<iostream>
#include<map>
#include<string>
using namespace std;
const int N=100010;
long long int a[N];
int main(){
    long long int sum=0,temp=0;
    string str;
    cin>>str;
    map<int, string> myMap {
        {0, "zero"},
        {1, "one"},
        {2, "two"},
        {3, "three"},
        {4, "four"},
        {5, "five"},
        {6, "six"},
        {7, "seven"},
        {8, "eight"},
        {9, "nine"},
    };
    for(int i=0;i<str.size();i++){
        sum+=str[i]-'0';
    }
    temp=sum;
    int k=0;
    //测试点2
    if(sum==0)a[k++]=0;
    // cout<<sum<<endl;
    while(temp){
        a[k++]=temp%10;
        temp/=10;
    }
    // a[0]=5,a[1]=1 k
    for(int j=k-1;j>=0;j--){
        cout<<myMap[a[j]];
        if(j!=0)
            printf(" ");
    }
    return 0;
}

​