75A.md (1509B)
1 Source: https://codeforces.com/problemset/problem/75/A 2 3 A. Life Without Zeros 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 stdin 16 17 output 18 19 stdout 20 21 Can you imagine our life if we removed all zeros from it? For sure we will have many problems. 22 23 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? 24 25 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. 26 27 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. 28 29 Input 30 31 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 as *c* = *a* + *b*. 32 33 Output 34 35 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. 36 37 Examples 38 39 Input 40 41 ``` 42 101 43 102 44 ``` 45 46 Output 47 48 ``` 49 YES 50 ``` 51 52 Input 53 54 ``` 55 105 56 106 57 ``` 58 59 Output 60 61 ``` 62 NO 63 ```