<p>Given a binary string <code>s</code> and a positive integer <code>n</code>, return <code>true</code><em> if the binary representation of all the integers in the range </em><code>[1, n]</code><em> are <strong>substrings</strong> of </em><code>s</code><em>, or </em><code>false</code><em> otherwise</em>.</p>

<p>A <strong>substring</strong> is a contiguous sequence of characters within a string.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> s = "0110", n = 3
<strong>Output:</strong> true
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> s = "0110", n = 4
<strong>Output:</strong> false
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s[i]</code> is either <code>&#39;0&#39;</code> or <code>&#39;1&#39;</code>.</li>
	<li><code>1 &lt;= n &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution {
public:
    bool queryString(string s, int n) {
        if (n >= 2047)
            return false;
        int reqLen = 0;
        int tmp = n;
        while (tmp)
        {
            ++reqLen;
            tmp >>= 1;
        }
        // std::cout << "I require substrings of length " << reqLen << '\n';
        if (s.length() < reqLen)
            return false;

        std::vector<bool> numPresent(n+1, false);
        for (int r=reqLen; r <= s.length(); ++r)
        {
            int num = 0;
            std::string v = s.substr(r-reqLen, reqLen);
            // std::cout << "Examining " << v << '\n';
            for (int i=r-reqLen; i < r; ++i)
            {
                num = num << 1 | (s[i]-'0');
                // std::cout << "\tcan make " << binPrint(num) << '\n';
                numPresent[num] = true;
            }
        }
        bool ret = true;
        for (int i=1; i < numPresent.size() && ret; ++i)
            ret &= numPresent[i];
        return ret; 
    }
};
8300