UVA424 – Integer Inquiry

來源:互聯網
上載者:User

題目連結:UVA424

大數相加問題,類比手算即可,具體看代碼:

#include<iostream>#include<cstdio>#include<cstring>using namespace std;char number[255]={'0'};int answer[260]={0};void reverse(char* pointer);int main(){    int maxIndex=0;    while(scanf("%s",number)&&strcmp(number, "0"))    {        int length=strlen(number);        reverse(number);        int index;        int carryBit=0;        for(index=0;index<length;index++)        {            carryBit=answer[index]+(number[index]-'0')+carryBit;            answer[index]=carryBit%10;            carryBit=carryBit/10;        }        while(carryBit)        {            carryBit=answer[index]+carryBit;            answer[index++]=carryBit%10;            carryBit=carryBit/10;        }        if(index>maxIndex)            maxIndex=index;    }    int flag=1;    for(int i=maxIndex;i>0;i--)    {        if(flag)        {            if(answer[i])            {                cout<<answer[i];                flag=0;            }        }        else            cout<<answer[i];    }    cout<<answer[0]<<endl;    memset(number,'0',255);    return 0;}void reverse(char* pointer){    int length=strlen(pointer);    char temp;    for(int i=0,j=length-1;i<j;i++,j--)    {        temp=pointer[i];        pointer[i]=pointer[j];        pointer[j]=temp;    }}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在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.