【HDU】 1002 A + B Problem II

A + B Problem II

---

• 题目链接
  A + B Problem II

---

• 题目大意

CF上的题感觉现在水题略多，干脆从第一页开始刷HDU算了….
题目意思很简单，给两个超长的数相加。

---

• 题解

就是个高精度，数据略坑，会有什么0000+000之类的东西…要把高位上的0都去掉。
果然高精度好久不写了手生啊….

---

• 代码

#include <iostream>
#include <cstring>
#include <cstdio>

using namespace std;

char s1[1005],s2[1005],s[1010];
int T;

void rev(char *s1)
{
    int l=strlen(s1);
    for (int i=0;i<=l/2-1;i++)
    {
        char s;
        s=s1[i]; s1[i]=s1[l-1-i]; s1[l-1-i]=s;
    }
}

void sum(char s1[],char s2[])
{
    memset(s,0,sizeof(s));
    int num,num1,num2,l1,l2,k=0;
    l1=strlen(s1); l2=strlen(s2);
    for (int i=0;i<max(l1,l2);i++)
    {
        num1=0; num2=0;
        if (i<l1) num1=s1[i]-48;
        if (i<l2) num2=s2[i]-48;
        num=num1+num2+k;
        if (num>=10)
        {
            k=1;
            num-=10;
        }
        else k=0;
        s[i]=num+48;
    }
    if (k) s[max(l1,l2)]=49;
}

int main()
{
    int t;
    scanf("%d",&T);
    t=T;
    while (T--)
    {
        printf("Case %d:\n",t-T);
        memset(s1,0,sizeof(s1));
        memset(s2,0,sizeof(s2));
        scanf("%s%s",s1,s2);
        cout <<s1<<" + "<<s2<<" = ";
        rev(s1); rev(s2);
        sum(s1,s2);
        int j=strlen(s)-1;
        while (j>0 && s[j]=='0') j--;
        for (int i=j;i>=0;i--) printf("%c",s[i]);
        printf("\n");
        if (T) printf("\n");
    }
    return 0;
}