【第22期】观点:IT 行业加班,到底有没有价值?

PAT甲级.1005. Spell It Right (20)

原创 2016年08月31日 10:32:31

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.

输入格式

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

PAT链接


思路:

1.二维数组存单词:

char convert[10][6] = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};

2.统计各位数字之和,从个位开始入栈

    // 统计字串各位数数字和
    for(int i = 0; i < len; i++)
    {
        sum += str[i] - '0';
    }
    // 每一位入栈再pop出来
    do
    {
        st.push(sum % 10);
        cnt++;
        sum /= 10;
    } while (sum != 0);

代码:

/**
* @tag     PAT_A_1005
* @authors R11happy (xushuai100@126.com)
* @date    2016-8-28 00:08-00:24
* @version 1.0
* @Language C++
* @Ranking  340/2590
* @function null
*/

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <stack>
using namespace std;

char convert[10][6] = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};

int main(int argc, char const *argv[])
{
    stack<int> st;
    char str[110];
    gets(str);
    int len = strlen(str);
    int sum = 0;
    int cnt = 0;    //记录入栈个数
    // 统计字串各位数数字和
    for(int i = 0; i < len; i++)
    {
        sum += str[i] - '0';
    }
    // 每一位入栈再pop出来
    do
    {
        st.push(sum % 10);
        cnt++;
        sum /= 10;
    } while (sum != 0);
    for(int i = 0; i<cnt-1; i++)
    {
        printf("%s ",convert[st.top()] );
        st.pop();
    }
    printf("%s",convert[st.top()] );
    st.pop();
    return 0;
}

收获:

熟悉栈(stack)的使用
1.声明

#include <stack>
using namespace std;

2.定义

    char str[110];

3.push
4.top, pop

版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

PAT甲级 1005. Spell It Right (20)

1005. Spell It Right (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard ...

PAT1005 Spell It Right

计算各个数字的和,并用英文将字母一个一个输出。 <br style="font-family: Helvetica, Tahoma, Arial, sans-serif; font-size: 14px; line-height: 25.200000762939453px; text-align: left;

[PAT甲级]1005. Spell It Right (20)

1005. Spell It Right (20)原题链接Given a non-negative integer N, your task is to compute the sum of all ...

PAT 1005 Spell It Right

  #include "stdio.h" #include "string.h" #define N 10 #define M 102 int mai

【PAT甲级】【C++】1005. Spell It Right (20)

#include #include void print_num(int num) { char str_num[4]={0}; char *temp=str_num; sprintf(str_...
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)