Pandigital Numbers Exceeding a Ratio

by Hang Wu   Last Updated October 16, 2018 08:20 AM

The problem is described in here. Though we can count the number of pandigital numbers not greater than $n$, denoted by $c_n$, in $O(log(n))$, by enumerating from high to low digits, but we cannot perform direct binary search on $\frac{c_n}{n}$ since it is not monotonically increasing.

Related Questions

Complexity of subset-generation algorithm

Updated August 09, 2015 20:08 PM

Complexity of determining spanning bipartite graph.

Updated August 09, 2017 21:20 PM