18 条题解

  • 0
    @ 2025-4-21 20:16:38
    ```cpp
    #include <bits/stdc++.h>
    using namespace std;
    #define LL long long
    const int N = 1e5 + 10;
    const int INF = 0x3f3f3f3f;
    string a1 , b1;
    int a[500] , b[500] , c[500];
    int main()
    {
        cin >> a1 >> b1;
        int lena = a1.size();
        int lenb = b1.size();
        for ( int i = 0 ; i < lena ; i++ )
    	{
            a[ lena - i ] = a1[i] - '0';
        }
        for ( int i = 0 ; i < lenb ; i++ )
    	{
            b[ lenb - i ] = b1[i] - '0';
        }
        int lenc = 1 , x = 0;
        while  ( lenc <= lena || lenc <= lenb )
    	{
            c[lenc] = a[lenc] + b[lenc] + x;
            x = c[lenc] / 10;
            c[lenc] = c[lenc] % 10;
            lenc++;
        }
        if ( x > 0 )
    	{
           c[lenc] = x;
        }
        else
    	{
           lenc--;
        }
        for ( int i = lenc ; i >= 1 ; i-- )
    	{
            cout << c[i];
    	}
        cout << endl;
    	return 0;
    }
    //菜鸟驿站
    //老六专属
    
    

    信息

    ID
    1
    时间
    1000ms
    内存
    128MiB
    难度
    1
    标签
    递交数
    4445
    已通过
    1237
    上传者