• 1005. Spell It Right


    1005. Spell It Right (20)

    时间限制
    400 ms
    内存限制
    65536 kB
    代码长度限制
    16000 B
    判题程序
    Standard
    作者
    CHEN, Yue

    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
    import java.util.Scanner;
    
    public class Main {
    
        public static void main(String[] args) {
            Scanner in=new Scanner(System.in);
            String n,str[]=new String [101];
            Integer sum=0;
            n=in.next();
            String s[]={"zero","one","two","three","four","five","six","seven"
                    ,"eight","nine"};
            for(int i=0;i<n.length();i++){
                sum=sum+n.charAt(i)-'0';
            }
            
            int len=sum.toString().length();
            while(len!=0){
                if(len!=1){
                    System.out.print(s[(int) (sum/Math.pow(10,len-1))]+" ");
                }
                else{
                    System.out.print(s[(int) (sum/Math.pow(10,len-1))]);
                }
                sum=(int) (sum%(Math.pow(10,len-1)));
                len--;
            }
    
        }
    
    }

    注意点:10^100int和double都不够,所以当做字符串读进来在进行计算

    错误代码:

    import java.util.Scanner;
    
    public class Main {
    
      public static void main(String[] args) {
        Scanner in=new Scanner(System.in);
        double n;
        Integer sum=0;
        n=in.nextDouble();
        String s[]={"zero","one","two","three","four","five","six","seven"
            ,"eight","nine"};
        while(n!=0){
          sum=(int) (sum+n%10);
          n=n/10;
        }
        int len=sum.toString().length();
        while(len!=0){
          if(len!=1){
            System.out.print(s[(int) (sum/Math.pow(10,len-1))]+" ");
          }
          else{
            System.out.print(s[(int) (sum/Math.pow(10,len-1))]);
          }
          sum=(int) (sum%(Math.pow(10,len-1)));
          len--;
        }
    
      }
    
    }
    
    

      结果

    参考

    http://blog.csdn.net/zhangveni/article/details/50878369

  • 相关阅读:
    17、静态链表
    16、约瑟夫问题
    15、循环链表
    9、插入排序
    14、企业链表
    13、单向链表
    12、顺序表的顺序存储结构
    11、归并排序
    10、快速排序
    原型模式
  • 原文地址:https://www.cnblogs.com/chen20135517/p/7689203.html
Copyright © 2020-2023  润新知