大整數減法

來源:互聯網
上載者:User

標籤:div   大整數   space   ||   --   iostream   for   style   enc   

#include<cmath>#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int maxn = 2000;int a[maxn];int b[maxn];int c[maxn];char s[maxn];char t[maxn];char n[maxn];int main(void){    cin>>s>>t;    int lens = strlen(s);    int lent = strlen(t);    if(lens<lent||lens==lent&&strcmp(s,t)<0)    {        strcpy(n,s);        strcpy(s,t);        strcpy(t,n);        cout<<"-";    }    lens = strlen(s);    lent = strlen(t);    for(int i = 0; i < lens; i++)        a[lens-i] = s[i]-‘0‘;    for(int i = 0; i < lent; i++)        b[lent-i] = t[i]-‘0‘;    int lenc = 1;    while(lenc<=lens||lenc<=lent)    {        if(a[lenc]<b[lenc])        {            a[lenc] += 10;            a[lenc+1]--;        }        c[lenc] = a[lenc]-b[lenc];        lenc++;    }     while(c[lenc]==0)        lenc--;    for(int i = lenc; i >= 1; i--)        cout<<c[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.