大数相加

最新推荐文章于 2021-07-18 20:35:50 发布

快快or乐乐

最新推荐文章于 2021-07-18 20:35:50 发布

阅读量404

点赞数

分类专栏： acm 文章标签：大数相加 acm

本文链接：https://blog.csdn.net/hongchu098/article/details/20399725

版权

acm 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

嘛，之前做大数相加时一直是一边相加一边进位，今天偶然看到别人全部加完后再处理进位，自己试了下，感觉还可以：

#include <iostream>
#include <deque>
using namespace std;

typedef unsigned char uchar;

class bigint
{
public:
  friend istream& operator>>(istream&,bigint&);
  friend ostream& operator<<(ostream&,const bigint&);
  bigint& operator+=(const bigint&);
private:
  deque<uchar> data_;
};

ostream& operator<<(ostream& os,const bigint& b)
{
  for(deque<uchar>::const_iterator iter=b.data_.begin();iter!=b.data_.end();++iter)
    os<<(int)(*iter);
  return os;
}

istream& operator>>(istream& is,bigint& b)
{
  string ts;
  is>>ts;
  b.data_.clear();
  for(string::iterator iter=ts.begin();iter!=ts.end();++iter)
    b.data_.push_back(*iter-'0');
  return is;
}

bigint& bigint::operator+=(const bigint& addend)
{
  if(data_.size()>addend.data_.size())
  {
    deque<uchar>::reverse_iterator dri=data_.rbegin();
    for(deque<uchar>::const_reverse_iterator sri=addend.data_.rbegin();
        sri!=addend.data_.rend();++dri,++sri)
      (*dri)+=(*sri);
  }
  else
  {
    for(deque<uchar>::size_type i=data_.size();i<addend.data_.size();++i)
      data_.push_front(0);
    deque<uchar>::reverse_iterator dri=data_.rbegin();
    for(deque<uchar>::const_reverse_iterator sri=addend.data_.rbegin();
        sri!=addend.data_.rend();++dri,++sri)
      (*dri)+=(*sri);
  }
  uchar tc=0;
  for(deque<uchar>::reverse_iterator ri=data_.rbegin();ri!=data_.rend();++ri)
  {
    tc=(*ri)/10;
    (*ri)%=10;
    if(tc!=0 && ri+1==data_.rend()){data_.push_front(tc);break;}
    if(tc!=0) *(ri+1)+=tc;
  }
  return *this;
}

int main()
{
  bigint a,b;
  while(cin>>a>>b)
  {
    a+=b;
    cout<<a<<endl;
  }
  return 0;
}

嘛，因为时间要求不严，代码也没怎么优化，仅仅是交上来而已。