Dailycode_7.4(不用加减乘除实现加法，三角形）

class Solution {
public:
    int Add(int num1, int num2)
    {
        int sum;
        int ret;
        while(num2)
        {
            sum = num1^num2;
            ret = (num1&num2)<<1;
            num1 = sum;
            num2 = ret;
        }
        return num1;
    }
};

#include<iostream>
using namespace std;
char s[10] = { '0','1','2','3','4','5','6','7','8','9' };
string add(string x, string y)
{
	string ans;
	int up = 0, now, i = x.length() - 1, j = y.length() - 1;
	int a, b;
	while (i >= 0 || j >= 0)
	{
		if (i >= 0) a = x[i] - '0';
		else       a = 0;
		if (j >= 0) b = y[j] - '0';
		else       b = 0;
		now = (up + a + b) % 10;
		ans.push_back(s[now]);
		up = (up + a + b) / 10;
		i--; j--;
	}
	if (up != 0) ans.push_back(s[up]);
	for (int k = 0; k < ans.length() / 2; k++) swap(ans[k], ans[ans.length() - 1 - k]);
	return ans;

}

bool com01dadeng(string x, string y)
{
	if (x.length() > y.length())         return true;
	else if (x.length() < y.length())    return false;
	for (int i = 0; i < x.length(); i++)
	{
		if (x[i] - '0' > y[i] - '0') return true;
		else if (x[i] - '0' == y[i] - '0') continue;
		else return false;
	}
	return true;
}

int main()
{
	string a, b, c;
	while (cin >> a >> b >> c)
	{
		if (com01dadeng(c, add(a, b))) { cout << "No" << endl; continue; }
		if (com01dadeng(a, add(c, b))) { cout << "No" << endl; continue; }
		if (com01dadeng(b, add(a, c))) { cout << "No" << endl; continue; }
		cout << "Yes" << endl;
	}
	return 0;
}