poj 2756 Autumn is a Genius

最新推荐文章于 2015-09-27 12:50:00 发布

蓝宇

最新推荐文章于 2015-09-27 12:50:00 发布

阅读量482

点赞数

分类专栏：高精度北大oj 文章标签： string output input

本文链接：https://blog.csdn.net/ll365594480/article/details/6711061

版权

北大oj 同时被 2 个专栏收录

42 篇文章 0 订阅

订阅专栏

高精度

1 篇文章 0 订阅

订阅专栏

题目大意：

输入两个整数a，b<32768(没说大于0，就有可能是负无穷，所以是一道高精度)，求a+b

a和b的前面都有可能'+'或者'-'

Sample Input

1 2

+1 +2
+1 -2

-1 -2

Sample Output

-1

-3

题目解答：

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>

using namespace std;

int n;
void update(string &s){
    int i;
    for(i = 0; i < s.size() - 1; i++){
        if(s[i] != '0'){
            break;
        }
    }
    s.erase(s.begin(),s.begin()+i);
}

int compare(string &s1,string &s2){
    int biao = 1;
    if(s1.size() < s2.size())  biao = 0;
    else if(s1.size() == s2.size()){
        for(int i = 0; i < s1.size();i++){
            if(s1[i] == s2[i])  continue;
            else if(s1[i] > s2[i]){
                break;
            }
            else{
                biao = 0;
                break;
            }
        }
    }
    if(biao == 0){
        string tmp = s1;
        s1 = s2;
        s2 = tmp;
    }
    return biao;
}
string sub(string s1,string s2){
    int tuiwei = 0;
    for(int i = s2.size() - 1,j = s1.size() - 1; j >= 0; i--,j--){
        if(i >= 0){
            if(s2[i] <= s1[j] - tuiwei){
                s1[j] = '0' + s1[j] - s2[i] - tuiwei;
                tuiwei = 0;
            }
            else{
                s1[j] = '0' + s1[j] + 10 - s2[i] - tuiwei;
                tuiwei = 1;
            }
        }
        else{
            if('0' <= s1[j] - tuiwei){
                s1[j] = s1[j] - tuiwei;
                tuiwei = 0;
            }
            else{
                s1[j] = s1[j] + 10 - tuiwei;
                tuiwei = 1;
            }
        }
    }
    update(s1);
    return s1;
}
string add(string s1,string s2){
    int jinwei=0;
    int lens1 = s1.size();
    int lens2 = s2.size();
    if(lens1 < lens2){
        string tmp = s1;
        s1 = s2;
        s2 = tmp;
    }
    for(int i = s2.size() - 1,j = s1.size() -1; j >= 0; i--,j--){
        if(i >= 0){
            int he = (s1[j] - '0') + s2[i] - '0' + jinwei;
            if(he >= 10){
                jinwei = 1;
                s1[j] = '0' + he - 10;
            }
            else{
                jinwei = 0;
                s1[j] = '0' + he;
            }
        }
        else{
            int he = (s1[j] - '0') + jinwei;
            if(he >= 10){
                jinwei = 1;
                s1[j] = '0' + he - 10;
            }
            else{
                jinwei = 0;
                s1[j] = '0' + he;
            }
        }
    }
    if(jinwei == 1)  s1 = "1"+s1;
    return s1;
}
char str1[1111000],str2[1111000];
int main(){
    scanf("%d", &n);
    while(n--){
        scanf("%s%s", str1, str2);
        string s1 = str1;
        string s2 = str2;
        if(s1[0] == '+'){
            s1.erase(s1.begin());
        }
        if(s2[0] == '+'){
            s2.erase(s2.begin());
        }
        if(s1[0] == '-' && s2[0] == '-'){
            s1.erase(s1.begin());
            s2.erase(s2.begin());
            update(s1);
            update(s2);
            printf("-%s\n", add(s1,s2).c_str());
        }
        else if(s1[0] == '-'){
            s1.erase(s1.begin());
            update(s1);
            update(s2);
            int fu = compare(s2,s1);
            if(fu == 0)  printf("-%s\n", sub(s2,s1).c_str());
            else printf("%s\n", sub(s2,s1).c_str());
        }
        else if(s2[0] == '-'){
            s2.erase(s2.begin());
            update(s1);
            update(s2);
            int fu = compare(s1,s2);
            if(fu == 0)  printf("-%s\n", sub(s1,s2).c_str());
            else printf("%s\n", sub(s1,s2).c_str());
        }
        else {
            update(s1);
            update(s2);
            printf("%s\n", add(s1,s2).c_str());
        }
    }
}