| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
贴个代码 前0和后0要注意#include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
while(cin>>n)
{
string s1,s2;
for(int i=0;i<n;i++)
{
cin>>s1>>s2;
int le=s1.length()<=s2.length()?s1.length():s2.length();
int a,b,c=0;
string s3=s1.length()>=s2.length()?s1:s2;
for(int i=0;i<le;i++)
{
a=s1[i]-'0';
b=s2[i]-'0';
s3[i]=((a+b+c)%10)+'0';
c=(a+b+c)/10;
}
s3+='0';
int tem;
if(c==1)
{
while(c)
{
tem=s3[le]-'0'+c;
s3[le]=tem%10+'0';
c=tem/10;
le++;
}
}
{
int q=0,h=0;
for(int i=0;i<s3.length();i++)
{
if(s3[i]!='0')
break;
q++;
}
for(int i=s3.length()-1;i>0;i--)
{
if(s3[i]!='0')
break;
h++;
}
for(;q<s3.length()-h;q++)
cout<<s3[q];
}
cout<<'\n';
}
}
}
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator