488A.md (1647B)
1 Source: https://codeforces.com/problemset/problem/488/A 2 3 A. Giga Tower 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 stdin 16 17 output 18 19 stdout 20 21 Giga Tower is the tallest and deepest building in Cyberland. There are 17 777 777 777 floors, numbered from - 8 888 888 888 to 8 888 888 888. In particular, there is floor 0 between floor - 1 and floor 1. Every day, thousands of tourists come to this place to enjoy the wonderful view. 22 23 In Cyberland, it is believed that the number "8" is a lucky number (that's why Giga Tower has 8 888 888 888 floors above the ground), and, an integer is lucky, if and only if its decimal notation contains at least one digit "8". For example, 8, - 180, 808 are all lucky while 42, - 10 are not. In the Giga Tower, if you write code at a floor with lucky floor number, good luck will always be with you (Well, this round is #278, also lucky, huh?). 24 25 Tourist Henry goes to the tower to seek good luck. Now he is at the floor numbered *a*. He wants to find the minimum positive integer *b*, such that, if he walks *b* floors higher, he will arrive at a floor with a lucky number. 26 27 Input 28 29 The only line of input contains an integer *a* ( - 109 ≤ *a* ≤ 109). 30 31 Output 32 33 Print the minimum *b* in a line. 34 35 Examples 36 37 Input 38 39 ``` 40 179 41 ``` 42 43 Output 44 45 ``` 46 1 47 ``` 48 49 Input 50 51 ``` 52 -1 53 ``` 54 55 Output 56 57 ``` 58 9 59 ``` 60 61 Input 62 63 ``` 64 18 65 ``` 66 67 Output 68 69 ``` 70 10 71 ``` 72 73 Note 74 75 For the first sample, he has to arrive at the floor numbered 180. 76 77 For the second sample, he will arrive at 8. 78 79 Note that *b* should be positive, so the answer for the third sample is 10, not 0.