TLE????????
查看原帖
TLE????????
1044048
Algorithm_ZRF楼主2023/8/1 11:46
#include <iostream>
#include <cstring>
#include <cmath>

using namespace std;

void invertElem(char s[], unsigned long n)
{
    unsigned long len = n - 1;
    for (int i = 0, j = len; i < j; i++, j--)
    {
        char temp = s[i];
        s[i] = s[j];
        s[j] = temp;
    }

}

void charInt(char s[], unsigned long n)
{
    for (unsigned long i = 0; i < n; i++)
        s[i] -= 48;
}

int main()
{
    while (1)
    {
        char a[1024];
        char b[1024];
        char c[2049];
        memset(a, 0, sizeof(a));
        memset(b, 0, sizeof(b));
        memset(c, 0, sizeof(c));
        scanf("%s", a);
        scanf("%s", b);
        unsigned long len_a = strlen(a);
        unsigned long len_b = strlen(b);
        unsigned long max_len = len_a > len_b ? len_a : len_b;
        invertElem(a, len_a);
        invertElem(b, len_b);
        charInt(a, len_a);
        charInt(b, len_b);
        int carry = 0;
        for (unsigned long i = 0; i <= max_len; i++)
        {
            c[i] = (carry + a[i] + b[i]) % 10;
            carry = (carry + a[i] + b[i]) / 10;
        }

        int i;
        for (i = max_len; i >= 1 && c[i] == 0; i--);
            printf("%d", c[i]);
        printf("\n");

    }


    return 0;
}
2023/8/1 11:46
加载中...