【HDOJ】1002 A + B Problem II

【题目】 http://acm.hdu.edu.cn/showproblem.php?pid=1002

【报告】

     不解释，简单的高精度加法，啥都不用考虑。

【程序】

// TASK: 1002 A + B Problem II
#include <cstdlib>
#include <iostream>
#include <cstdio>
#include <string>
#define L 1000
using namespace std;
class num
{
      public:
             int a[L+1];
             long len;
             inline void clear()
             {
                    memset(a,0,sizeof(a));
                    len=L+1;
             }
             num()
             {
                  clear();
             }
}a,b;
string A,B;
inline long min(long a,long b)
{
       return ((a<b)?a:b);
}
inline void turn(string a,num&b)
{
       for (long i=a.length()-1;i>=0;i--)
           b.a[--b.len]=a[i]-'0';
}
inline void addi(num&a,num b)
{
       for (long i=L;i>0;i--) a.a[i]+=b.a[i];
       for (long i=L;i>0;i--)
       {
           a.a[i-1]+=a.a[i]/10;
           a.a[i]%=10;
       }
}
inline void print(num a)
{
       long i=0;
       while (a.a[i]<=0&&i<L) i++;
       while (i<=L) cout << a.a[i++];
}
int main(int argc, char *argv[])
{
    long t;
    cin >> t;

转载于:https://www.cnblogs.com/klarkxy/archive/2012/08/06/10017158.html