Spell It Right (20)

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

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

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT #ACM

PAT甲级(Advanced Level) 专栏收录该内容

36 篇文章

订阅专栏

本篇博客介绍了一道编程题目，任务是计算一个非负整数各位数字之和，并将每位数字的和用英语单词形式输出。示例输入为12345，输出为onefive。博客提供了完整的C++代码实现。

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

Spell It Right (20)

时间限制 1000 ms 内存限制 32768 KB 代码长度限制 100 KB 判断程序 Standard (来自小小)
题目描述
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.

输入描述:
Each input file contains one test case. Each case occupies one line which contains an N (<= 10100).

输出描述:
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.

输入例子:
12345

输出例子:
one five

题解：关键在于对于字符串的处理，n<10^100 最大和每一位都是9,也就是最大也是9*100是三位数字然后模拟就好了

#include<bits/stdc++.h>
#include<stdlib.h>
#include<iostream>
using namespace std;
#define vi vector<int>
#define pii pair<int,int>
#define x first
#define y second
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define SZ(x) x.size()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,a,b) for(int i=b-1;i>=a;i--)
#define pi acos(-1)
#define mod 1000000007
#define inf 1000000007
#define ll long long
#define DBG(x) cerr<<(#x)<<"="<<x<<"\n";
#define N 200010
template <class U,class T> void Max(U &x, T y){if(x<y)x=y;}
template <class U,class T> void Min(U &x, T y){if(x>y)x=y;}
template <class T> void add(int &a,T b){a=(a+b)%mod;}
int main()
{

    int ans=0,ans1[111],k=0;
    string eng[10]={"zero","one","two","three","four","five","six","seven","eight","nine"};
    string n;
    cin>>n;
    rep(i,0,n.length())
    {

        ans+=(n[i]-'0');
    }
    if(ans==0)
    {
        cout<<eng[0];
    }
    else{
        while(ans!=0)
        {
            ans1[k++]=ans%10;
            ans=ans/10;
        }
        per(i,0,k)
        {
            cout<<eng[ans1[i]];
            if(i!=0) cout<<" ";
        }
    }
    return 0;
}