hdu 1002(简单高精度)

题目大意:

给你两个数a, b; 输出a + b

题目分析:

      大数问题,套大数类模板,就可以了;

模板目录:点击打开链接


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

using namespace std;

struct BigInteger{
    static const int BASE = 100000000;
    static const int WIDTH = 8;
    vector<int> s;

    BigInteger(long long num = 0) { *this = num; }
    BigInteger& operator = (long long);
    BigInteger& operator = (string&);

    BigInteger operator + (BigInteger &b);   //正数相加;
    BigInteger operator - (BigInteger &b);    //正数相减, 结果为正数;
//    BigInteger operator * (int b);
//    BigInteger operator / (int b);
//    BigInteger operator % (int b);
};

BigInteger& BigInteger::operator = (long long num){
    s.clear();
    do{
        s.push_back(num % BASE);
        num /= BASE;
    }while(num > 0);
    return *this;
}
BigInteger& BigInteger::operator = (string &str){
    s.clear();
    int x, len = (str.length()-1)/WIDTH + 1;
    for(int i = 0; i < len; ++i){
        int _end = str.length()-WIDTH*i;
        int start = max(0, _end-WIDTH);
        sscanf(str.substr(start, _end-start).c_str(), "%d", &x);
        s.push_back(x);
    }
    return *this;
}

BigInteger BigInteger::operator + (BigInteger &b){
    BigInteger c;
    c.s.clear();
    for(int i = 0, g = 0; ; ++i){
        if(g == 0 && i >= s.size() && i >= b.s.size()) break;
        int x = g;
        if(i < s.size()) x += s[i];
        if(i < b.s.size()) x += b.s[i];
        c.s.push_back(x % BASE);
        g = x / BASE;
    }
    return c;
}

BigInteger BigInteger::operator - (BigInteger &b){
    BigInteger c;
    c.s.clear();
    for(int i = 0, g = 0; ; ++i){   //bug;
        if(g == 0 && i >= s.size() && i >= b.s.size()) break;
        int x = g + s[i];
        if(i < b.s.size()) x -= b.s[i];
        if(x < 0) { c.s.push_back(BASE + x); g = -1; }
        else {c.s.push_back(x); g = 0; }
    }
    if(c.s.back() == 0) c.s.erase(c.s.end()-1);
    return c;
}

ostream& operator << (ostream &out, const BigInteger &b){
    out << b.s.back();
    for(int i = b.s.size()-2; i >= 0; --i){
        char buf[10];
        sprintf(buf, "%08d", b.s[i]);
        out << buf;
    }
    return out;
}
istream& operator >> (istream &in, BigInteger &b){
    string str;
    in >> str;
    b = str;
    return in;
}

int main()
{
    string s1, s2;
    int T;
    int cas = 0;
    scanf("%d", &T);
    while(T--){
        cin >> s1 >> s2;
        BigInteger a1, a2;
        a1 = s1; a2 = s2;
        printf("Case %d:\n", ++cas);
        cout << s1  << " + " << s2 << " = " << a1+a2 << endl;
        if(T)
            printf("\n");

    }
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值