zoukankan      html  css  js  c++  java
  • POJ 1503 Integer Inquiry 简单大数相加

    Description

    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

    #include <iostream>
    #include <string>
    #include <stdio.h>
    using namespace std;
    string doo(string str1,string str2){
        string s;
        int str11=str1.length();
        int str22=str2.length();
    
        if(str11>str22){
            for(int i=0;i<str11-str22;i++){
                str2="0"+str2;
            }
        }
        else{
            for(int i=0;i<str22-str11;i++){
                str1="0"+str1;
            }
        }
        str11=str1.length();
    
        int cmp=0;
        int cf=0;
        for(int i=str11-1;i>=0;i--){
            cmp=str1[i]-'0'+str2[i]-'0'+cf;
            cf=cmp/10;
            cmp=cmp%10;
            s=char(cmp+'0')+s;
        }
        if(cf!=0){
            s=char(cf+'0')+s;
        }
    
        return s;
    
    
    }
    int main(){
       string sum="0";
       string str;
       while(cin>>str){
            if(str=="0"){
                break;
            }
        sum=doo(sum,str);
       }
       cout<<sum<<endl;
       return 0;
    }
    

    另外二种方法

    #include <string>
    #include <stdlib.h>
    #include <stdio.h>
    #include <string.h>
    
    char a[200],b[200],c[200],d[200];
    int main()
    {
        int n1,n2;
        b[0]='0';
        while(1){
            scanf("%s",a);
            if(strcmp(a,"0")==0){
                  printf("%s
    ",b);
                  return 0;
            }
            int i;
            int n1=strlen(a)-1;
            int n2=strlen(b)-1;
            int p=0;
            for(i=0;n1>=0||n2>=0;i++,n1--,n2--)
            {
                if(n1>=0&&n2>=0){c[i]=a[n1]+b[n2]-'0'+p;}
                if(n1>=0&&n2<0){c[i]=a[n1]+p;}
                if(n1<0&&n2>=0){c[i]=b[n2]+p;}
               p=0;
                if(c[i]>'9'){c[i]=c[i]-10;p=1;}
            }
            if(p==1){
                c[strlen(c)]='1';
            }
            for(int i=0;i<strlen(c);i++){
                d[strlen(c)-i-1]=c[i];
            }
    
            strcpy(b,d);
    
        }
    }
    

    ——————————————————

    #include <stdio.h>
    #include <stdlib.h>
    #include <string.h>
    
    char a[200],b[200],c[200];
    int main()
    {
        //int n1,n2;
        b[0]='0';
        while(~scanf("%s",a))
        {
            if(strcmp(a,"0")==0)
            {
                    printf("%s
    ",b);
                    return 0;
            }
            int i;
            int n1=strlen(a)-1;
            int n2=strlen(b)-1;
            int p=0;
            i=n1;
            if(i<n2)
                i=n2;
            for(i; n1>=0||n2>=0; i--,n1--,n2--)
            {
                if(n1>=0&&n2>=0)
                {
                    c[i]=a[n1]+b[n2]-'0'+p;
                }
                if(n1>=0&&n2<0)
                {
                    c[i]=a[n1]+p;
                }
                if(n1<0&&n2>=0)
                {
                    c[i]=b[n2]+p;
                }
                p=0;
                if(c[i]>'9')
                {
                    c[i]=c[i]-10;
                    p=1;
                }
            }
            if(p==1)
            {
    
                for(i=strlen(c); i>0; i--)
                    c[i]=c[i-1];
                c[0]='1';
            }
            strcpy(b,c);
        }
    }
    
  • 相关阅读:
    04.Spark的核心组件
    02.Spark 标签生成(Java和Scala的两种实现)
    01.Spark(spark shell实现word count)
    Scala--尾递归--泛型--类型上下限界定--多重界定--视图界定--型变(协变--逆变)--隐式转换--SAM
    01.安装JDK配置环境变量
    Scala模式匹配--样例类--密封样例类--偏函数
    00.Spark--安装Spark
    Scala知识点总结(上半部分)
    01. Java的经典排序--选择排序--冒泡排序--折半查找(二分查找)
    2019-2020学年 20191327《信息安全专业导论》第五周学习总结
  • 原文地址:https://www.cnblogs.com/webmen/p/5739601.html
Copyright © 2011-2022 走看看