# LeetCode - 1317. Convert Integer to the Sum of Two No-Zero Integers
### 題目網址：https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/
###### tags: `LeetCode` `Easy`

/*
    -LeetCode format-
    Problem: 1317. Convert Integer to the Sum of Two No-Zero Integers
    Difficulty: Easy
    
    by Inversionpeter
*/



bool haveZero[10001] = { true };

static const auto Initialize = []{
    ios::sync_with_stdio(false); cin.tie(nullptr);
    for (int i = 1, j; i <= 10000; ++i) {
        j = i;
        while (j) {
            if (!(j % 10))
                haveZero[i] = true;
            j /= 10;
        }
    }
    return nullptr;
}();


class Solution {
public:
    vector<int> getNoZeroIntegers(int n) {
        int A = 1;
        while (haveZero[A] || haveZero[n - A])
            ++A;
        return { A, n - A };
    }
};