杭電OJ1002大資料相加

來源:互聯網
上載者:User

標籤:

先輸入n ,代表共有幾組數字,再輸入n組資料

#include<iostream>#include<stdio.h>#include<math.h>#include<string.h>#include<algorithm>#include<malloc.h>using namespace std;char resu[10000];void Reverse(char a[10000]){    int leng = strlen(a);    char temp;    for (int i = 0; i < leng / 2; i++)    {        temp = a[leng - i - 1];        a[leng - i - 1] = a[i];        a[i] = temp;    }    return ;}char *toAdd(char a[10000], char b[10000]){    Reverse(a);    Reverse(b);    char min[10000], max[10000];        if (strlen(a) >= strlen(b))    {        strcpy_s(min, b);        strcpy_s(max, a);    }    else    {        strcpy_s(min, a);        strcpy_s(max, b);    }    int jinwei = 0;    for (int i = 0; i < (int)strlen(min); i++)    {        if (min[i] + max[i] - ‘0‘ - ‘0‘ + jinwei>=10)        {            resu[i] = min[i] + max[i] - ‘0‘ + jinwei - 10;            jinwei = 1;        }        else        {            resu[i] = min[i] + max[i] - ‘0‘ + jinwei;            jinwei = 0;        }    }    int i;    for (i = strlen(min); i < (int)strlen(max); i++)    {        if (max[i]- ‘0‘ + jinwei>=10)        {            resu[i] =max[i]+ jinwei - 10;            jinwei = 1;        }        else        {            resu[i] =max[i]+ jinwei;            jinwei = 0;        }    }    if (jinwei)    {        resu[i] = jinwei + ‘0‘;        resu[++i] = ‘\0‘;    }    else    resu[i] = ‘\0‘;    Reverse(resu);    return resu;}int  main( ){    int n; char a[20][10000], b[20][10000];    cin >> n;    for (int i = 0; i < n; i++)    {        cin >> a[i] >> b[i];        }    for (int i = 0; i < n; i++)    {        cout << "Case " << i+1 << ":" << endl;        cout << a[i] << " + " << b[i] << " = ";        toAdd(a[i], b[i]);        int k = 0;        while (resu[k] == ‘0‘)            k++;        if (k == strlen(resu))        {            cout << "0";            cout << endl;        }        else        {            for (int o = k; o < strlen(resu);o++)            cout << resu[o];            cout << endl;        }        if (i <( n - 1))            cout << endl;    }    return 0;}

杭電OJ1002大資料相加

相關文章

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.