九度OJ 1003 A+B

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

int main()
{
string A,B;
while (cin>>A>>B)
{
long m = 0, n = 0;
for (int i = 0; i < A.length(); i++)
{

if (A[i] >= '0' && A[i] <= '9')
{
//求出字符对应的数值
m = m * 10 + A[i] - '0';

}
}
for (int i = 0; i < B.length(); i++)
{

if (B[i] >= '0' && B[i] <= '9')
{
//求出字符对应的数值
n = n * 10 + B[i] - '0';

}
}

if (A[0] == '-')
{
m = 0 - m;
}
if (B[0] == '-')
{
n = 0 - n;
}

cout<<m + n<<endl;

}
return 0;

}