1005. Spell It Right (20)

最新推荐文章于 2024-05-17 16:45:04 发布

原创最新推荐文章于 2024-05-17 16:45:04 发布 · 339 阅读

0 ·

CC 4.0 BY-SA版权

PAT(Advanced level) 专栏收录该内容

7 篇文章

订阅专栏

本博客介绍了一个算法，用于计算给定非负整数的各位数字之和，并输出每个数字的英文表述。

摘要生成于 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

#include <iostream>
#include <string>
#include <stack>
using namespace std;

#define N 101

void Print_Number(int num)
{
    switch (num)
    {
        case 0:
            cout<<"zero";
            break;
            
        case 1:
            cout<<"one";
            break;

        case 2:
            cout<<"two";
            break;
        case 3:
            cout<<"three";
            break;
            
        case 4:
            cout<<"four";
            break;
            
        case 5:
            cout<<"five";
            break;
        case 6:
            cout<<"six";
            break;
            
        case 7:
            cout<<"seven";
            break;
            
        case 8:
            cout<<"eight";
            break;

            
        default:
            cout<<"nine";
            
    }
}

int main(int argc, const char * argv[])
{
    //Store the number by string
    char Str[N]={0};
    cin>>Str;
    
    //Caculate the sum of the number
    int i=0,sum=0;
    int temp=0;
    while (Str[i]!='\0')
    {
        temp=Str[i]-'0'+0;
        sum+=temp;
        i++;
    }
    
    //Output sum by English
    stack<int> Q;
    int remain=0;
    if (sum==0)
    {
        cout<<"zero";
    }else
    {
        while (sum!=0)
        {
            Q.push(sum%10);
            sum/=10;
        }
        int flag=0;//标志用来判断第几次输出，第一次输出不输出空格
        while (!Q.empty())
        {
            temp=Q.top();
            Q.pop();
            if(!flag)
            {
                Print_Number(temp);
                flag=1;
            }else
            {
                cout<<' ';
                Print_Number(temp);
            }
        }
    }
    
    
    return 0;
}