2001.cpp

ZOJ 动态规划算法题目入门与提高 源代码

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;

int main()
{
    int n;
	cin>>n;
	while(n--)
	{
        string a,b;
		cin>>a>>b;
		if(b.length()<a.length())  swap(a,b);
		int aa=a.length();
		int bb=b.length();
		int t=0;
		string c="";
		for(int i=0;i<aa;i++)
	    {
		    int sum=a[i]-'0'+b[i]-'0'+t;
			t=sum/10;
			sum%=10;
			c+=char(sum+'0');
    	}
		for(int i=aa;i<bb;i++)
		{
		    int sum=b[i]-'0'+t;
			t=sum/10;
			sum%=10;
			c+=char(sum+'0');
		}
		if(t!=0) c+=char(t+'0');
  	    t=0;
		while(c[t]=='0') t++;
		c=c.substr(t,c.length()-t);
		cout<<c<<'\n';	
	}
    return 0;
}