高精度加减乘除

 加法

void solve()
{
    mem(s, 0, sizeof(s));
    cin >> a >> b;
    int len1 = strlen(a), len2 = strlen(b);
    reverse(a, a + strlen(a));
    reverse(b, b + strlen(b));
    len = max(len1, len2);
    fo (i, 0, len - 1)
    {
        if (a[i] >= '0' && a[i] <= '9' && i < len1)
            s[i] += a[i] - '0';
        if (b[i] >= '0' && b[i] <= '9' && i < len2)
            s[i] += b[i] - '0';
        tt = i;
        if (s[i] > 9)
            s[i] -= 10, s[i + 1]++, tt = i + 1;
    }
    reverse(s, s + tt + 1);
    f = 0;
    fo (i, 0, tt)
    {
        if (s[i] != 0)
            f = 1;
        if (f)
            cout << s[i];
    }
    if (f == 0)
        cout << '0';
    cout << '\n'; 
    return;
}

减法

乘法

db ax[N], ay[N], bx[N], by[N];
char sa[N / 2], sb[N / 2];
int sum[N], x1[N], x2[N];
int revv(int x, int bits)
{
    int ret = 0;
    fo(i, 0, bits - 1)
    {
        ret <<= 1;
        ret |= x & 1;
        x >>= 1;
    }
    return ret;
}
void fft(db *a, db *b, int n, bool rev)
{
    int bits = 0;
    while (1 << bits < n)
        ++bits;
    fo(i, 0, n - 1)
    {
        int j = revv(i, bits);
        if (i < j)
            swap(a[i], a[j]), swap(b[i], b[j]);
    }
    for (int len = 2; len <= n; len <<= 1)
    {
        int half = len >> 1;
        db wmx = cos(2 * pi / len), wmy = sin(2 * pi / len);
        if (rev)
            wmy = -wmy;
        for (int i = 0; i < n; i += len)
        {
            db wx = 1, wy = 0;
            fo(j, 0, half - 1)
            {
                db cx = a[i + j], cy = b[i + j];
                db dx = a[i + j + half], dy = b[i + j + half];
                db ex = dx * wx - dy * wy, ey = dx * wy + dy * wx;
                a[i + j] = cx + ex, b[i + j] = cy + ey;
                a[i + j + half] = cx - ex, b[i + j + half] = cy - ey;
                db wnx = wx * wmx - wy * wmy, wny = wx * wmy + wy * wmx;
                wx = wnx, wy = wny;
            }
        }
    }
    if (rev)
        fo(i, 0, n - 1)
        {
            a[i] /= n, b[i] /= n;
        }
}
int getl(int a[], int na, int b[], int nb, int ans[])
{
    int len = max(na, nb), ln;
    for (ln = 0; (1 << (ln)) < len; ln++)
        ;
    len = 1 << (++ln);
    fo(i, 0, len - 1)
    {
        if (i >= na)
            ax[i] = 0, ay[i] = 0;
        else
            ax[i] = a[i], ay[i] = 0;
    }
    fft(ax, ay, len, 0);
    fo(i, 0, len - 1)
    {
        if (i >= nb)
            bx[i] = 0, by[i] = 0;
        else
            bx[i] = b[i], by[i] = 0;
    }
    fft(bx, by, len, 0);
    fo(i, 0, len - 1)
    {
        db cx = ax[i] * bx[i] - ay[i] * by[i];
        db cy = ax[i] * by[i] + ay[i] * bx[i];
        ax[i] = cx, ay[i] = cy;
    }
    fft(ax, ay, len, 1);
    fo(i, 0, len - 1)
        ans[i] = (int)(ax[i] + 0.5);
    return len;
}
string mul(string sa, string sb)
{
    int l1, l2, l, i;
    string s;
    mem(sum, 0);
    l1 = sa.size(), l2 = sb.size();
    fo(i, 0, l1 - 1)
        x1[i] = sa[l1 - i - 1] - '0';
    fo(i, 0, l2 - 1)
        x2[i] = sb[l2 - i - 1] - '0';
    l = getl(x1, l1, x2, l2, sum);
    for (i = 0; i < l || sum[i] >= 10; i++)
        sum[i + 1] += sum[i] / 10, sum[i] %= 10;
    l = i;
    while (sum[l] <= 0 && l > 0)
        l--;
    of(i, l, 0)
        s += sum[i] + '0';
    return s;
}
void solve()
{
    string a, b;
    cin >> a >> b;
    cout << mul(a, b) << '\n';
    return;
}