大数相加(HDU1002)

大数相加c语言版

#include <stdio.h>
#include <string.h>
const int maxn = 2000;
int arr[maxn];
char str1[maxn], str2[maxn];

int jiafa(int len1, int len2)
{
    int sum=0;
    while(len1>0&&len2>0){
        arr[sum] = (str1[--len1] - '0') + (str2[--len2] - '0') + arr[sum];
        arr[sum+1] = arr[sum] / 10;
        arr[sum] %= 10;
        sum++;
    }
    while(len1>0){
        arr[sum] = (str1[--len1] - '0') + arr[sum];
        arr[sum+1] = arr[sum] / 10;
        arr[sum] %= 10;
        sum++;
    }
    while(len2>0){
        arr[sum] = (str2[--len2] - '0') + arr[sum];
        arr[sum+1] = arr[sum] / 10;
        arr[sum] %= 10;
        sum++;
    }
    if(arr[sum]!=0)
        return sum;
    else
        return (sum-1);
}
int main()
{
    int n;
    scanf("%d",&n);
    for(int p=1;p<=n; p++){
        memset(arr,0,sizeof(arr));
        memset(str1,0,sizeof(str1));
        memset(str2,0,sizeof(str2));

        scanf("%s %s", str1, str2);

        int len1 = strlen(str1);
        int len2 = strlen(str2);
        int lrh = jiafa(len1, len2);

        printf("Case %d:\n",p);
        printf("%s + %s = ",str1,str2);
        for(int i=lrh; i>=0; i--)
            printf("%d",arr[i]);
        printf("\n");
        if(p!=n)
            printf("\n");
    }
    return 0;
}

大数相加c++版,vector、string实现

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>

using namespace std;

void GetNum(vector<int> &tag, string &str, int len, int MaxLen){
    for(int i=0; i<len; i++)
        tag[MaxLen-i] = str[len-i-1]-'0';
    return ;
}

string addition(string &first, string &second){
    int FirstLen = first.size();
    int SecondLen = second.size();
    int MaxLen = max(FirstLen, SecondLen);

    vector<int> First(MaxLen+1, 0);
    vector<int> Second(MaxLen+1, 0);
    GetNum(First, first, FirstLen, MaxLen);
    GetNum(Second, second, SecondLen, MaxLen);

    vector<int> add(MaxLen+1, 0);
    for(int i=MaxLen; i>=0; i--){
        add[i] += (First[i] + Second[i]);
        add[i-1] += add[i]/10;
        add[i] = add[i] % 10;
    }

    string ans = "";
    int Size = add.size();
    if(add[0]!=0) ans += (add[0]+'0');
    for(int i=1; i<Size; i++) ans += (add[i]+'0');
    return ans;
}

int main(){
    int t; cin>>t;
    string s1, s2;
    for(int oo=1; oo<=t; oo++){
        cin>>s1>>s2;
        string ans = addition(s1, s2);
        cout<<"Case "<<oo<<":"<<endl;
        cout<<s1<<" + "<<s2<<" = "<<ans<<endl;
        if(oo!=t) cout<<endl;
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值