洛谷1601 a+b

题目

https://www.luogu.org/problemnew/show/P1601#sub

高精度求a+b

#include <cstdio>
#include <string>
#include <iostream>
#include <algorithm>

using namespace std;

const int maxSize=500;
string s1,s2;
int a[maxSize+5],b[maxSize+5],ans[maxSize+5];

int main()
{
	int i,jw,len,j;
	
	freopen("a.txt","r",stdin);
	cin>>s1;
	cin>>s2;
	for (i=0;i<s1.length();i++)
		a[s1.length()-i]=s1[i]-'0';
	for (i=0;i<s2.length();i++)
		b[s2.length()-i]=s2[i]-'0';
	
	len=max(s1.length(),s2.length());
	jw=0;
	for (i=1;i<=len;i++)
	{
		ans[i]=a[i]+b[i]+jw;
		jw=ans[i]/10;
		ans[i]%=10;
	}
	if (jw!=0)
		ans[i]=jw;
	else
		i--;
		
	for (j=i;j>=1;j--)
		cout<<ans[j];
	
	return 0;
}