【CodeForces】67A - Life Without Zeros（水）

A. Life Without Zeros

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Can you imagine our life if we removed all zeros from it? For sure we will have many problems.

In this problem we will have a simple example if we removed all zeros from our life, it's the addition operation. Let's assume you are given this equation a + b = c, where a and b are positive integers, and c is the sum of a and b. Now let's remove all zeros from this equation. Will the equation remain correct after removing all zeros?

For example if the equation is 101 + 102 = 203, if we removed all zeros it will be 11 + 12 = 23 which is still a correct equation.

But if the equation is 105 + 106 = 211, if we removed all zeros it will be 15 + 16 = 211 which is not a correct equation.

Input

The input will consist of two lines, the first line will contain the integer a, and the second line will contain the integer b which are in the equation as described above (1 ≤ a, b ≤ 109). There won't be any leading zeros in both. The value of c should be calculated asc = a + b.

Output

The output will be just one line, you should print "YES" if the equation will remain correct after removing all zeros, and print "NO" otherwise.

Examples

input

101
102

output

YES

input

105
106

output

NO

对去0操作的函数写好了，这道题也没问题了。

代码如下：

#include <cstdio>
int remove(int n)
{
	int m = 0;
	int t = 1;
	while (n != 0)
	{
		if (n % 10 != 0)
		{
			m += n % 10 * t;
			t *= 10;
		}
		n /= 10;
	}
	return m;
}
int main()
{
	int a,b,c;
	int ta,tb;
	while (~scanf ("%d",&a))
	{
		scanf ("%d",&b);
		c = a + b;
		ta = remove (a);
		tb = remove (b);
		if (ta + tb == remove (c))
			printf ("YES\n");
		else
			printf ("NO\n");
	}
	return 0;
}