高精度加法

userId_undefined
七七八八

2025-05-04 11:04:16

发布于：浙江

45阅读
0回复
0点赞

高精度加法

#include<bits/stdc++.h>
using namespace std;
string s1,s2;
int a1[10000],a2[10000],sum[10000];
int main(){
	cin >> s1 >> s2;
	int len1 = s1.size();
	int len2 = s2.size();
	for(int i = 0;i < len1;i++){
		a1[i] = s1[len1-1-i]-48;
	} 
	for(int i = 0;i < len2;i++){
		a2[i] = s2[len2-1-i]-48;
	} 
	int cur = 0,start = 0;
	while(start < len1 || start < len2){
		sum[start] = cur + a1[start] + a2[start];
		cur = sum[start]/10;
		sum[start]%=10;
		start++;
	}
	if(cur){
		sum[start] = 1;
	}else{
		start--;
	}
	for(int i = start;i >= 0;i--){
		cout << sum[i];
		
	}
	return 0;
}
userId_undefined
去预览
0/2000

全部评论 2

  • userId_undefined
    七七八八

    #include<bits/stdc++.h>
    using namespace std;
    string s1,s2;
    int a1[10000],a2[10000],sum[10000];
    int main(){
    cin >> s1 >> s2;
    int len1 = s1.size();
    int len2 = s2.size();
    for(int i = 0;i < len1;i++){
    a1[i] = s1[len1-1-i]-48;
    }
    for(int i = 0;i < len2;i++){
    a2[i] = s2[len2-1-i]-48;
    }
    int cur = 0,start = 0;
    while(start < len1 || start < len2){
    sum[start] = cur + a1[start] + a2[start];
    cur = sum[start]/10;
    sum[start]%=10;
    start++;
    }
    if(cur){
    sum[start] = 1;
    }else{
    start--;
    }
    for(int i = start;i >= 0;i--){
    cout << sum[i];

    }
return 0;

    }
    高精度加法

    2025-04-20 来自 浙江

    0
  • userId_undefined
    45℃
    时空双修者出道萌新秩序白银

    工作室合作

    2024-08-23 来自 上海

    0

热门讨论