【HDOJ】1230 火星A+B

个人觉得这道题没那么水，wa了几次，才发现自己居然没有给srcb数组reset，打错了。搞死啊。

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

#define MAXNUM 26
int srca[MAXNUM];
int srcb[MAXNUM];
int isPrime[MAXNUM] = {2, 3, 5, 7, 11,13,17,19,23,29,31,37,41,
                       43,47,53,59,61,67,71,73,79,83,89,97,101};


void reverse(int a[], int beg, int end) {
    int tmp, i, k=beg+end-1;

    for (i=beg; i+i<=k; ++i) {
        tmp = a[i];
        a[i] = a[k-i];
        a[k-i] = tmp;
    }
}

void testsrc(int src[], int len) {
    int i;
    for (i=0;i<len;++i)
        printf("%d ", src[i]);
    printf("
");
}

void magicadd(int lena, int lenb) {
    int ov = 0;
    int i;

    reverse(srca, 0, lena);
    reverse(srcb, 0, lenb);

    for (i=0; i<MAXNUM; ++i) {
        srca[i] += (srcb[i] + ov);
        ov = srca[i] / isPrime[i];
        srca[i] = srca[i] % isPrime[i];
    }
}

int main() {
    int lena, lenb, flg, tmp;
    char ch;
    int i;

    while (1) {
        memset(srca, 0, sizeof(srca));
        memset(srcb, 0, sizeof(srcb));
        flg = lena = lenb = tmp = 0;
        while (1) {
            ch = getchar();
            if (ch == ' ') {
                srca[lena++] = tmp;
                flg = 1;
                tmp = 0;
            } else if (ch == ',') {
                if (flg)
                    srcb[lenb++] = tmp;
                else
                    srca[lena++] = tmp;
                tmp = 0;
            } else if (ch == '
') {
                srcb[lenb++] = tmp;
                break;
            } else {
                tmp = tmp*10+ch-'0';
            }
        }
        if (lena==1 && lenb==1 && srca[0]==0 && srcb[0]==0)
            break;
        magicadd(lena, lenb);
        i = MAXNUM-1;
        while (srca[i] == 0)
            i--;
        for (; i>0; i--)
            printf("%d,", srca[i]);
        printf("%d
", srca[0]);
    }

    return 0;
}