PAT甲级 1005 Spell It Right （20 分）

最新推荐文章于 2024-11-12 15:59:45 发布

liuxinghuiblog

最新推荐文章于 2024-11-12 15:59:45 发布

阅读量253

点赞数

分类专栏： PAT

本文链接：https://blog.youkuaiyun.com/liuxinghui_SJTU/article/details/87613388

版权

PAT 专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一个程序设计挑战，即给定一个非负整数N，计算其所有位数的和，并将这个和的每一位用英文单词表示。输入是一个不超过10^100的大整数，输出则是该整数各位数字和的英文表示，各单词间以空格分隔，末尾无额外空格。

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

1005 Spell It Right （20 分）

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:

Sample Output:

one five

codes:
#include<iostream>
using namespace std;
int main(){
  string s;
  cin >> s;
  int sum=0;
  for(int i=0;i<s.length();i++)
    sum+=(s[i]-'0');
  string t=to_string(sum);
  string arr[10]={"zero","one","two","three","four","five","six","seven","eight","nine"};
  cout<<arr[t[0]-'0'];
  for(int j=1;j<t.length();j++)
  cout<<" "<<arr[t[j]-'0'];
  return 0;
}