ZOJ-1352

大数加法乘法除法。。折腾了我两个晚上，细节处理各种坑爹，中间步骤太多，稍不留神就错。。和sample的output对上后提交，还一直RE。。改了改后发现是free的用法不对，我malloc之后尽量都free掉了，有些中间变量懒的去free了，调用的时机不对反而会RE，真是坑爹啊

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<ctype.h>

void reverse(char *s)
{
    int len = strlen(s);
    int i, j;
    char c;
    for (i = 0, j = len - 1; i < j; i++, j--)
    {
        c = *(s + i);
        *(s + i) = *(s + j);
        *(s + j) = c;
    }
}

char *removeHeadZero(char *s)
{
    char *r;
    while (*s++ == '0')
        ;
    r = --s;
    return r;
}

char *appendTailZero(char *s, int zeros)
{
    int i, len = strlen(s);
    char *r = malloc(len + zeros + 1);
    for (i = 0; i < len; i++)
        *(r + i) = *(s + i);
    for (i = len; i < len + zeros; i++)
        *(r + i) = '0';
    *(r + len + zeros) = '\0';
    return r;
}

char *add(char *s1, char *s2)
{
    int l1 = strlen(s1);
    int l2 = strlen(s2);
    int len = l1 > l2 ? l1 : l2;
    char *r = malloc(len + 2);
    int i, prev = 0, a, b, sum;
    for (i = 0; i < len; i++)
    {
        a = l1 - 1 - i >= 0 ? *(s1 + l1 - 1 - i) - '0' : 0;
        b = l2 - 1 - i >= 0 ? *(s2 + l2 - 1 - i) - '0' : 0;
        sum = a + b + prev;
        *(r + i) = sum > 9 ? sum - 10 + '0' : sum + '0';
        prev = sum > 9 ? 1 : 0;
    }
    if (prev)
    {
        *(r + len) = '1';
        *(r + len + 1) = '\0';
    }
    else
        *(r + len) = '\0';
    reverse(r);
    return r;
}

char *multiplyHelper(char *s1, int digit)
{
    int i, res, prev = 0, len = strlen(s1);
    char *r = malloc(len + 2);
    if (!digit)
    {
        *r = '0';
        *(r + 1) = '\0';
        return r;
    }

    for (i = 0; i < len; i++)
    {
        res = (*(s1 + len - 1 - i) - '0') * digit + prev;
        *(r + i) = res % 10 + '0';
        prev = res / 10;
    }
    if (prev)
    {
        *(r + len) = prev + '0';
        *(r + len + 1) = '\0';
    }
    else
        *(r + len) = '\0';
    reverse(r);
    return r;
}

char *multiply(char *s1, char *s2)
{
    if (strlen(s1) < strlen(s2))
    {
        char *temp;
        temp = s1;
        s1 = s2;
        s2 = temp;
    }
    int l2 = strlen(s2);
    int i;
    char *t, *zt;
    char *sum = malloc(2);
    sum = "0";
    for (i = 0; i < l2; i++)
    {
        t = multiplyHelper(s1, *(s2 + l2 - 1 - i) - '0');
        zt = appendTailZero(t, i);
        sum = add(sum, zt);
        free(t);
        free(zt);
    }
    return sum;
}

char *divide(char *s, int num, int *remain)
{
    int i, rem = 0, len = strlen(s);
    char *r = malloc(len + 1);
    for (i = 0; i < len; i++)
    {
        rem = rem * 10 + *(s + i) - '0';
        *(r + i) = rem / num + '0';
        rem %= num;
    }
    *remain = rem;
    *(r + len) = '\0';
    r = removeHeadZero(r);
    if (!strlen(r))
    {
        *r = '0';
        *(r + 1) = '\0';
    }
    return r;
}

int main()
{
    char s[1000], from[3];
    char *res;
    int n, to, i;
    scanf("%d", &n);
    while (n--)
    {
        scanf("%s %d %s", from, &to, s);
        printf("%s %s\n", from, s);
        reverse(s);
        char *factor = malloc(2);
        *factor = '1';
        *(factor + 1) = '\0';
        char *sum = malloc(2);
        *sum = '0';
        *(sum + 1) = '\0';
        for (i = 0; i < strlen(s); i++)
        {
            int d = *(s + i);
            if (isdigit(d))
                d -= '0';
            if (isupper(d))
                d = d - 'A' + 10;
            if (islower(d))
                d = d - 'a' + 36;
            char cd[3];
            sprintf(cd, "%d", d);
            sum = add(sum, multiply(factor, cd));
            factor = multiply(factor, from);
        }
        res = malloc(1000);
        int remain;
        char *div = sum;
        i = 0;
        while (strcmp(div, "0") != 0)
        {
            div = divide(div, to, &remain);
            char c;
            if (remain < 10)
                c = remain + '0';
            else if (remain < 36)
                c = remain - 10 + 'A';
            else
                c = remain - 36 + 'a';
            *(res + i++) = c;
        }
        if (!i)
        {
            *res = '0';
            i++;
        }
        *(res + i) = '\0';
        reverse(res);
        printf("%d %s\n\n", to, res);
        free(factor);
        free(sum);
        free(res);
    }
    return 0;
}