zoukankan      html  css  js  c++  java
  • PAT甲级——A1005 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.

    输入描述:

    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

    太简单了。。。。
     1 #include <iostream>
     2 #include <string>
     3 #include <vector>
     4 
     5 using namespace std;
     6 
     7 int main()
     8 {
     9     vector<string>words = { "zero","one","two","three","four","five","six","seven","eight","nine","ten" };
    10     string num;//不能用数字类型存储,会导致溢出的
    11     cin >> num;
    12     int sum = 0;
    13     for (auto a : num)
    14         sum += a - '0';
    15     num = to_string(sum);
    16     cout << words[num[0] - '0'];
    17     for (int i = 1; i < num.length(); ++i)
    18         cout << " " << words[num[i] - '0'];
    19     cout << endl;
    20     return 0;
    21 }
  • 相关阅读:
    【转】教你爱上Blocks(闭包)
    【转】iOS Developer:真机测试
    bzoj1231 混乱的奶牛
    bzoj2064 分裂
    洛谷P2051 中国象棋
    洛谷P2607 骑士
    洛谷P1879 玉米田
    洛谷P3694 邦邦的大合唱
    openjudge dp水题记录
    bzoj1191 超级英雄
  • 原文地址:https://www.cnblogs.com/zzw1024/p/11172364.html
Copyright © 2011-2022 走看看