A1005Spell It Right

标签：++   str   com   using   sum   put   you   bottom   转化   

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 (≤).

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

思路：

定义字符串s存储N，将字符转化成数字累加，最后将和sum转化成字符串，利用字符串数组映射转化输出。

 1 #include <iostream>
 2 #include <string>
 3 using namespace std;
 4 int main() {
 5     string s;
 6     cin >> s;
 7     int sum = 0;
 8     for (int i = 0; i < s.length(); i++) {
 9         sum += s[i] - ‘0‘;
10     }
11     string str = to_string(sum);
12     string mp[11] = { "zero","one","two","three","four","five","six","seven","eight","nine","ten" };
13     for (int i = 0; i < str.length(); i++) {
14         if (i != 0)cout << " ";
15         cout << mp[str[i]-‘0‘];
16     }
17     return 0;
18 }

A1005Spell It Right

标签：++   str   com   using   sum   put   you   bottom   转化   

原文地址：https://www.cnblogs.com/PennyXia/p/12296170.html