POJ 1503 Integer Inquiry 高精度加法

來源:互聯網
上載者:User

題意:輸入若干個大整數,求其和。

#include <cstring>#include <iostream>using namespace std;int sum[111];char str[101];int main(){int i, j, len;while ( cin >> str ){len = strlen(str);if ( strcmp(str,"0") == 0 ) break;for ( i = 110, j = len - 1; j >= 0 && i >= 0; i--, j-- )sum[i] += str[j] - '0';}for ( i = 110; i > 0; i-- ){sum[i-1] += sum[i] / 10;sum[i] %= 10;}for ( i = 0; sum[i] == 0 && i < 111; i++ );if ( i == 111 ) cout << 0;for ( ;i < 111; i++ ) cout << sum[i];cout << endl;return 0;}

聯繫我們

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