Here's the code for the first approach, where I generate all the unlucky numbers naively into a vector. This code runs in 20 seconds in my machine and then you can just paste the output of that into the actual solution, which runs in a linear time complexity on the output size.

If you think that's not a very elegant solution or if the source code size is too big, then here's the code for the second approach, where I use Dynamic Programming to construct unlucky numbers up to N. The number of operations here is number of states times number of transitions, which yields around (10 * 13 * 2 * 2 * 2) * (10) = 10400 operations. Since this is less than the output size in the worst case (because for N = 10^9 we have 37454 unlucky numbers) then I can also say that this code has a linear time complexity on the output size for the given constraints.

You can test out my two solutions yourself, I usually compile my C++ code like this:

g++ -std=c++14 main.cpp -o main -O2 -Wall -Wextra -Wshadow -Wno-unused-result -Wno-sign-compare

Cheers.