高精度计算

1.高精度练习之加法
http://codevs.cn/problem/3116/
代码：

#include<bits/stdc++.h>
#define MAX_LEN 501

using namespace std;

void to_number(char *str, int len, int *num)
{
    for (int i = len; i > 0; i--)
        num[len-i+1] = str[i-1] - '0';
}

int main()
{
    char s1[MAX_LEN], s2[MAX_LEN];
    cin >> s1 >> s2;

    int a[MAX_LEN], b[MAX_LEN];
    memset(a, 0 ,sizeof(a));
    memset(b, 0 ,sizeof(b));
    to_number(s1, strlen(s1), a);
    to_number(s2, strlen(s2), b);

    int last = 0;
    int ans[MAX_LEN];
    memset(ans, 0, sizeof(ans));
    for (int i = 1; i < MAX_LEN; i++)
    {
        ans[i] = a[i] + b[i] + last;
        last = ans[i] / 10;
        ans[i] = ans[i] % 10;
    }

    int len = MAX_LEN-1;
    for (len; len > 0; len--)
        if (ans[len] != 0) break;
    for (int i = len; i > 0; i--)
        cout << ans[i];

    return 0;
}

2.高精度练习之减法
http://codevs.cn/problem/3115/
代码：

#include<bits/stdc++.h>
#define MAX_LEN 501

using namespace std;

int cmp(char *str1, char *str2)
{
    if (strlen(str1) < strlen(str2))
        return -1;
    else
        if (strlen(str1) == strlen(str2))
            return strcmp(str1, str2);
        else
            return 1;
}

void to_number(char *str, int len, int *num)
{
    for (int i = len; i > 0; i--)
        num[len-i+1] = str[i-1] - '0';
}

int main()
{
    char s1[MAX_LEN], s2[MAX_LEN];
    cin >> s1 >> s2;

    int sign = 1;
    if (cmp(s1, s2) == -1) 
    {
        sign = -1;
        swap(s1, s2);
    }

    int a[MAX_LEN], b[MAX_LEN];
    memset(a, 0 ,sizeof(a));
    memset(b, 0 ,sizeof(b));
    to_number(s1, strlen(s1), a);
    to_number(s2, strlen(s2), b);

    int ans[MAX_LEN];
    memset(ans, 0, sizeof(ans));
    for (int i = 1; i < MAX_LEN; i++)
    {
        ans[i] = a[i] - b[i];
        if (ans[i] < 0)
        {
            ans[i] += 10;
            a[i+1] -= 1;
        }
    }

    if (sign == -1) cout << '-';

    int len = MAX_LEN-1;
    for (len; len > 0; len--)
        if (ans[len] != 0) break;
    for (int i = len; i > 0; i--)
        cout << ans[i];

    return 0;
}

3.高精度练习之乘法
http://codevs.cn/problem/3117/
代码：

#include<bits/stdc++.h>
#define MAX_LEN 1001

using namespace std;

void to_number(char *str, int len, int *num)
{
    for (int i = len; i > 0; i--)
        num[len-i+1] = str[i-1] - '0';
}

int main()
{
    char s1[MAX_LEN], s2[MAX_LEN];
    cin >> s1 >> s2;

    int a[MAX_LEN], b[MAX_LEN];
    memset(a, 0 ,sizeof(a));
    memset(b, 0 ,sizeof(b));
    to_number(s1, strlen(s1), a);
    to_number(s2, strlen(s2), b);

    int c[MAX_LEN];
    memset(c, 0, sizeof(c));
    for (int i = 1; i <= strlen(s1); i++)
        for (int j = 1; j <= strlen(s2); j++)
            c[i+j-1] += a[i] * b[j];

    int last = 0;
    for (int i = 1; i < MAX_LEN; i++)
    {
        c[i] += last;
        last = c[i] / 10;
        c[i] %= 10;
    }

    int len = MAX_LEN-1;
    for (len; len > 0; len--)
        if (c[len] != 0) break;
    for (int i = len; i > 0; i--)
        cout << c[i];

    return 0;
}