UVa 465 Overflow

WA了好多次，错误1：对类似数字0001111没有处理前面的0； 错误2：以为大数乘0还是大数...(傻了)

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

using namespace std;

#ifndef BIGN_H_INCLUDED
#define BIGN_H_INCLUDED

#define MAX_N 1000 //最大位数

//大数
struct bign {
    char s[MAX_N];
    int len;
    bign() {
        memset(s, 0, sizeof(s));
        len = 1;
    }
    bign(int num) {
        *this = num;
    }
    bign(const char *num) {
        *this = num;
    }
    bign operator = (const char *num) {
        len = strlen(num);
        for(int i=0; i<len && num[len-1-i]>='0' && num[len-1-i]<='9'; i++) {
            s[i] = num[len-1-i] - '0';
        }
        while(s[len-1] == 0) len--;
        return *this;
    }
    bign operator = (int num) {
        char s[MAX_N];
        sprintf(s, "%d", num);
        *this = s;
        return *this;
    }
    bign operator + (const bign &b) const
    {
        bign c;
        int m = len > b.len ? len : b.len;
        int i, g, sum;
        for(i=0, g=0; g || i< m; i++) {
            sum = g;
            if(i < len) sum += s[i];
            if(i < b.len) sum += b.s[i];
            c.s[i] = sum%10;
            g = sum / 10;
        }
        c.len = i;
        return c;
    }

    bign operator += (const bign &b)
    {
        *this = *this + b;
        return *this;
    }

    bign operator * (const bign &b) const
    {
        bign c;
        int i, j, g, sum;
        for(i=0; i<b.len; i++) {
            g = 0;
            for(j=0; g||j<len; j++) {
                sum = c.s[i+j] + g;
                if(j < len) sum += b.s[i]*s[j];
                c.s[j+i] = sum % 10;
                if(c.s[j+i] > 0) c.len = i+j+1;
                g = sum / 10;
            }
        }
        return c;
    }

    bign operator *= (const bign &b)
    {
        *this = *this * b;
        return *this;
    }

    bool operator < (const bign &b) const
    {
        if(b.len != len) return len < b.len;
        int i;
        for(i=len-1; i>=0; i--) {
            if(s[i] != b.s[i]) return s[i] < b.s[i];
        }
        return false;
    }


    bool operator > (const bign &b) const { return b < *this;}


    bool operator <= (const bign &b) const {return !(*this > b);}


    bool operator >= (const bign &b) const {return !(*this < b);}


    bool operator != (const bign &b) const {return (*this < b) || (*this > b);}


    bool operator == (const bign &b) const {return !(*this < b) && !(*this > b);}


};


ostream& operator << (ostream& outstream, const bign& b)
{
    for(int i=b.len-1; i>=0; i--) {
        outstream << (int)b.s[i] << "";
    }
    return outstream;
}


istream& operator >> (istream& instream, bign& b)
{
    string s;
    instream >> s;
    b = s.c_str();
    return instream;
}
#endif // BIGN_H_INCLUDED

#define MAX_INT ((1u<<(sizeof(int)*8-1))-1)
int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    #endif


    bign a, b;
    char x[301],y[301];
    char op;  // 0:+, 1:*

    while(scanf("%s %c %s", x, &op, y) == 3) {
        printf("%s %c %s\n", x, op, y);
        a = x;
        b = y;
        //cout << (1<<31)-1 << endl;
        if(a > MAX_INT) {cout << "first number too big" << endl;}
        if(b > MAX_INT) {cout << "second number too big" << endl;}
        if(op == '+') a += b;
            else a *= b;
        if(a > MAX_INT) cout << "result too big" << endl;
    }
    return 0;
}