zoukankan      html  css  js  c++  java
  • 【PAT】1005 Spell It Right

    题目:http://pat.zju.edu.cn/contests/pat-a-practise/1005

    分析:简单题。将输入的字符串一个个的转换成数字再相加,然后将相加的结果用英文打印出来就可以。输入输出的顺序需要用到栈的知识。

    题目描述:

    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:
    12345
    
    Sample Output:
    one five
    

    参考代码:

    #include<iostream>
    #include<string.h>
    #include<string>
    #include<stack>
    using namespace std;
    #define max 102
    char input[max];
    int main()
    {
    	cin>>input;
    	int len;
    	int sum=0,i,temp;
    	stack<string> result;
    	len = strlen(input);
    	for(i=0; i<len; i++)
    		sum += input[i] - '0';	
    
    	do
    	{
    		temp = sum%10;
    		if(temp == 0) result.push("zero");
    		else if(temp == 1) result.push("one");
    		else if(temp == 2) result.push("two");
    		else if(temp == 3) result.push("three");
    		else if(temp == 4) result.push("four");
    		else if(temp == 5) result.push("five");
    		else if(temp == 6) result.push("six");
    		else if(temp == 7) result.push("seven");
    		else if(temp == 8) result.push("eight");
    		else if(temp == 9) result.push("nine");
            sum /= 10;
    	}while(sum != 0);
    
    	cout<<result.top();
    	result.pop();
    	while(!result.empty())
    	{
    		cout<<" "<<result.top();
    		result.pop();
    	}
    	cout<<endl;
    	return 0;
    }


  • 相关阅读:
    Scala Partial Function从官方文档解析
    Scala Option 从官方DOC解析
    Scala Nothing 从官方DOC翻译
    从HTTP request的body中拿到JSON并反序列化为一个对象
    将一个大文件分割成若干个小文件,每个文件最多10万行
    java 可变长度参数列表
    java Class类的用法示例
    java String int转换的不同方法
    转载:大公司与小公司的比较
    java 判断5张牌的组成
  • 原文地址:https://www.cnblogs.com/bbsno1/p/3278428.html
Copyright © 2011-2022 走看看