1002 A + B Problem II
2008-11-12 19:12
253 查看
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
void add(string &,string &);
int main()
{
for(int n;cin>>n;)
{
int m=0,k=1;
for(string s1,s2;n--&&cin>>s1>>s2;)
{
cout<<(m++?"/n":"");
cout<<"Case "<<k++<<":/n"<<s1<<" + "<<s2<<" = ";
string a(1000,'0');
add(a,s1);
add(a,s2);
reverse(a.begin(),a.end());
cout<<a.substr(a.find_first_not_of('0'))<<"/n";
}
}
return 0;
}
void add(string &a,string &b)
{
int temp=0;
reverse(b.begin(),b.end());
int k=b.length();
for(int i=0;i<k||temp;i++)
{
temp+=(a[i]-'0')+(i < k)*(b[i]-'0');
a[i]=temp%10+'0';
temp/=10;
}
}
#include<algorithm>
#include<string>
using namespace std;
void add(string &,string &);
int main()
{
for(int n;cin>>n;)
{
int m=0,k=1;
for(string s1,s2;n--&&cin>>s1>>s2;)
{
cout<<(m++?"/n":"");
cout<<"Case "<<k++<<":/n"<<s1<<" + "<<s2<<" = ";
string a(1000,'0');
add(a,s1);
add(a,s2);
reverse(a.begin(),a.end());
cout<<a.substr(a.find_first_not_of('0'))<<"/n";
}
}
return 0;
}
void add(string &a,string &b)
{
int temp=0;
reverse(b.begin(),b.end());
int k=b.length();
for(int i=0;i<k||temp;i++)
{
temp+=(a[i]-'0')+(i < k)*(b[i]-'0');
a[i]=temp%10+'0';
temp/=10;
}
}
相关文章推荐
- HDU 1002 A + B Problem II 大数相加
- 杭电acm 1002 (A+B Problem II)
- 杭电ACM----------1002 A+B problemII
- HDOJ1002 A + B Problem II
- HDOJ 1002 A + B Problem II(大数A+B)
- 杭电1002---A + B Problem II
- hdu 1002 A + B Problem II(java)
- 杭电OJ 1002题 A + B Problem II
- ACM:HDU-1002 A + B Problem II
- A + B Problem II - 1002
- HDOJ1002 A + B Problem II(大数)
- HDOJ1002题A + B Problem II,2个大数相加
- HDU 1002 A + B Problem II (大数加法)
- HDU 1002 A + B Problem II
- hdu 1002 A + B Problem II(大数相加)
- 1002 A + B Problem II
- hdu1002 A + B Problem II(大数题)
- hdu 1002 A + B Problem II
- Hdu 1002 A + B Problem II(大整数加法)
- HDU1002 -A + B Problem II(大数a+b)