[hdu 1002] A + B Problem II

杭大的题,总是PE.

原因:最后一行没有空行. - -|||.

附上悠长的代码

版本一

#include <stdio.h>

int main()
{
    char A[1002], B[1002], C[1002];
    int nA, nB, nC;
    char *max, *min;
    char c;
    int maxLenght, minLenght;

    int N;
    scanf("%d
", &N);
    for (int index = 0; index < N; index++)
    {
        // read A
        for (nA = 0, c = getchar(); c != ' '; c = getchar(), nA++)
        {
            A[nA] = c;
        }

        // read B
        for (nB = 0, c = getchar(); c != '
'; c = getchar(), nB++)
        {
            B[nB] = c;
        }

        // comput C
        if (nA > nB)
        {
            max = A;
            min = B;
            maxLenght = nA;
            minLenght = nB;
        }
        else
        {
            max = B;
            min = A;
            maxLenght = nB;
            minLenght = nA;
        }
        
        nC = 0;
        int reserve = 0, s, odd = maxLenght - minLenght;

        for (int i = minLenght - 1; 0 <= i; i--)
        {
            s = reserve + max[odd + i] + min[i] - 2 * '0';
            reserve = s / 10;
            C[minLenght - i - 1] = s - reserve * 10 + '0';
        }

        for (int i = odd - 1; 0 <= i; i--)
        {
            s = reserve + max[i] - '0';
            reserve = s / 10;
            C[maxLenght - i - 1] = s - reserve * 10 + '0';
        }

        if (reserve)
        {
            C[maxLenght] = reserve + '0';
            nC = maxLenght + 1;
        }
        else
        {
            nC = maxLenght;
        }

        // output
        printf("Case %d:
", index + 1);
        for (int i = 0 ; i < nA; i++)
        {
            putchar(A[i]);
        }
        printf(" + ");
        for (int i = 0 ; i < nB; i++)
        {
            putchar(B[i]);
        }
        printf(" = ");
        for (int i = nC - 1; 0 <= i; i--)
        {
            putchar(C[i]);
        }

        if (index < N - 1)
        {
            printf("

");
        }
        else
        {
            printf("
");
        }
    }

    return 0;
}

版本二,短了一点,输入输出的地方做了改进 - - 

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

int main()
{
    char A[1002], B[1002], C[1002];
    int nA, nB, nC;
    char *max, *min;
    int maxLenght, minLenght;

    int N;
    scanf("%d
", &N);
    for (int index = 0; index < N; index++)
    {
        // read A B
        scanf("%s%s", A, B);
        nA = strlen(A);
        nB = strlen(B);

        // comput C
        if (nA > nB)
        {
            max = A;
            min = B;
            maxLenght = nA;
            minLenght = nB;
        }
        else
        {
            max = B;
            min = A;
            maxLenght = nB;
            minLenght = nA;
        }
        
        nC = 0;
        int reserve = 0, s, odd = maxLenght - minLenght;

        for (int i = minLenght - 1; 0 <= i; i--)
        {
            s = reserve + max[odd + i] + min[i] - 2 * '0';
            reserve = s / 10;
            C[minLenght - i - 1] = s - reserve * 10 + '0';
        }

        for (int i = odd - 1; 0 <= i; i--)
        {
            s = reserve + max[i] - '0';
            reserve = s / 10;
            C[maxLenght - i - 1] = s - reserve * 10 + '0';
        }

        if (reserve)
        {
            C[maxLenght] = reserve + '0';
            nC = maxLenght + 1;
        }
        else
        {
            nC = maxLenght;
        }

        // output
        printf("Case %d:
%s + %s = ", index + 1, A, B);
        for (int i = nC - 1; 0 <= i; i--)
        {
            putchar(C[i]);
        }
        if (index < N - 1)
        {
            printf("

");
        }
        else
        {
            printf("
");
        }
    }

    return 0;
}