zoukankan      html  css  js  c++  java
  • PTA (Advanced Level) 1005 Spell It Right

    Spell It Right

      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

    题目解析

      本题给出一个小于10的100次方的数字,要求计算其每一位的数字的和,并由最大为开始以英文输出和的每一位。

      将给出的数字记录在字符串num中计算字符串每一位减去字符’0’后的和即可得到给出数字每一位的和,以字符串数组str[ ]记录其下标数字对应的英文单词。

      最后将得到的和每一位对应的单词记录并输出即可。

     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 const string str[10] = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};
     4 int getSum(string num){ //计算给出数字每一位的和
     5     int ans = 0;
     6     for(auto i : num)
     7         ans += i - '0';
     8     return ans;
     9 }
    10 int main()
    11 {
    12     string num;
    13     cin >> num; //输入num
    14     int sum = getSum(num);  //求每一位的和
    15     vector<string> ans; //记录sum每一位对应的英文单词
    16     do{ //由于可能出现sum为0的情况,所以用do while
    17         ans.push_back(str[sum % 10]);
    18         sum /= 10;
    19     }while(sum);
    20     reverse(ans.begin(), ans.end());    //由于记录时时由低位到高位记录,所以将其反转ans
    21     for(int i = 0; i < ans.size(); i++){    //输出答案
    22         if(i != 0)
    23             printf(" ");
    24         cout << ans[i];
    25     }
    26     return 0;
    27 }
  • 相关阅读:
    Ubuntu 或 UbuntuKyLin14.04 Unity桌面側边栏和顶层菜单条显示异常解决方法
    关于程序猿的几个阶段!
    独立开发人员低成本推广APP的18条技巧
    Effective C++ 条款27
    OpensStack instance debug
    OpenStackCLI调试及术语识记
    OpenStack术语名词及问题调试
    apacheOfbiz
    obiz
    How to run OFBiz as a Service on linux
  • 原文地址:https://www.cnblogs.com/suvvm/p/10645626.html
Copyright © 2011-2022 走看看