1002

最新推荐文章于 2024-08-15 08:50:04 发布

lmttzt

最新推荐文章于 2024-08-15 08:50:04 发布

阅读量258

点赞数

分类专栏： HDACM 文章标签： iterator string

本文链接：https://blog.csdn.net/lmttzt/article/details/7761064

版权

HDACM 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

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

char inttochar(int tmp)
{
	return tmp+48;
}

int chartoint(char tmp)
{
	return tmp-48;
}
int main()
{
    string first,second,sum;
    int time;
    int i=1;
	
	cin>>time;
	while( i< time+1){
		cin>>first;
		cin>>second;
		int flag=0;
		int tmp=0;
				
		string::reverse_iterator first_r=first.rbegin();
		string::reverse_iterator second_r=second.rbegin();

		while(first_r!= first.rend()  && second_r !=second.rend())
		{
		   tmp= chartoint(*first_r) + chartoint(*second_r)+ flag ;
                   if(tmp>9)
		   {
			tmp=tmp-10;
			flag=1;
		   }
		   else flag=0;
		
		   sum.push_back(inttochar(tmp));
	           first_r++;
		   second_r++;
		}

		if(first_r == first.rend())
		{	
		   while(second_r!= second.rend())
		   {
			tmp=chartoint(*second_r) +flag;

			 if(tmp>9)
			 {
			    tmp=tmp-10;
			    flag=1;
			 }
			 else flag=0;
		    	 sum.push_back(inttochar(tmp));		        
		         second_r++;
		    }
		}
		else if(second_r == second.rend())
		{
                   while(first_r != first.rend())
		   {
			 tmp= chartoint(*first_r)+flag;		
			 if(tmp>9)
			 {
			    tmp=tmp-10;
			    flag=1;
			  }
			  else flag=0;
			  sum.push_back(inttochar(tmp));
			   
			  first_r++;
		   }
		}
		
		if(flag==1)
		   sum.push_back('1');
		
		reverse(sum.begin(),sum.end());
		cout<<"Case"<<" "<<i<<":"<<endl;	
		cout<<first<<" "<<"+"<<" "<<second<<" "<<"= "<<" "<<sum<<endl;
                cout<<endl;
                i++;
		first.clear();
		second.clear();
		sum.clear();
	}
}

可惜总是 Presentation Error