zoukankan      html  css  js  c++  java
  • 424 Integer Inquiry(整数查询)

     Integer Inquiry 

    One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.

    ``This supercomputer is great,'' remarked Chip. ``I only wish Timothy were here to see these results.'' (Chip moved to a new apartment, once one became available on the third floor of the Lemon Sky apartments on Third Street.)

     

    Input

    The input will consist of at most 100 lines of text, each of which contains a single VeryLongInteger. Each VeryLongInteger will be 100 or fewer characters in length, and will only contain digits (no VeryLongInteger will be negative).

     

    The final input line will contain a single zero on a line by itself.

     

    Output

    Your program should output the sum of the VeryLongIntegers given in the input.

     

    Sample Input

     

    123456789012345678901234567890
    123456789012345678901234567890
    123456789012345678901234567890
    0

     

    Sample Output

     

    370370367037037036703703703670



    题目大意:

      大整数相加,实际上像是小学的竖式求和,一位一位的相加就可以了。

    注意点:WA了两次,后来发现,原来最后输出之后,要有个换行符!!!

    后来发现,不一定需要判断最后的一行是0,可以一直读到EOF。


    下面贴出两种不同想法的代码:

    代码一:

    将所有行都读完,再来进行大数计算。

    #include <stdio.h>
    #include <stdlib.h>
    #include <string.h>
    #define INF 1e9
    
    char str[105][105];
    int num[105][105];
    int ans[10010];
    
    int main(){
        int i, j;
        int len, count, max = -INF, flag;
    
        i = 0;
        while(~scanf("%s", str[i])){
            if(str[i][0] == '0')  break;
            i++;
        }
    
        count = i;
        memset(num, 0, sizeof(num));
        for(i = 0; i<count; i++){
            len = strlen(str[i]);
            for(j = 0; j<len; j++){
                num[i][len-j] = (str[i][j]-'0');
            }
            if(max<len)
                max = len;
        }
    
        memset(ans, 0, sizeof(ans));
    
        for(i = 0; i<count; i++){
            for(j = 1; j<=max; j++){
                ans[j] += num[i][j];
            }
        }
    
        for(i = 1; i<10010;i++){
            ans[i] += ans[i-1]/10;
            ans[i-1] %= 10;
        }
    
        flag = 0;
        for(i=10009; i>0; i--){
            if(flag){
                printf("%d", ans[i]);
            }
            else if(ans[i]){
                flag = 1;
                printf("%d", ans[i]);
            }
        }
        printf("
    ");
        return 0;
    }



    代码二:

    没读一行字符串,进行一次大数相加。

    #include <stdio.h>
    #include <stdlib.h>
    #include <math.h>
    #include <string.h>
    
    char str[100];
    int num[100];
    int ans[10000];
    
    int main(){
        int i, j;
        int len, flag;
    
        memset(ans, 0, sizeof(ans));
        while(~scanf("%s", str)){
            len = strlen(str);
            memset(num, 0, sizeof(num));
            for(i = 0; i<len; i++)
                num[len-i] = str[i]-'0';
    
            for(i = 1; i<=len; i++)
                ans[i] += num[i];
    
            for(i = 1; i<10000; i++){
                ans[i] += (ans[i-1]/10);
                ans[i-1] %= 10;
            }
        }
    
        flag = 0;
        for(i=10000-1; i>0; i--){
            if(flag)
                printf("%d", ans[i]);
            else if(ans[i]){
                printf("%d", ans[i]);
                flag = 1;
            }
        }
        printf("
    ");
        return 0;
    }
  • 相关阅读:
    5 -- Hibernate的基本用法 --5 1 持久化类的要求
    5 -- Hibernate的基本用法 --5 深入理解持久化对象
    Java -- POI -- 随笔汇总
    jdk 自带的数据库Derby使用
    SpringMVC中 -- @RequestMapping的作用及用法
    Hibernate -- Dao层 -- CURD -- 随记
    JAVA WEB -- request
    SpringMVC -- @RequestMapping -- 随记
    Navicat -- Oracle -- 错误锦集
    Tomcat -- 启动错误 -- 解决锦集
  • 原文地址:https://www.cnblogs.com/bbsno1/p/3260529.html
Copyright © 2011-2022 走看看