<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 {
    int getVal(const string& sub) {
        int val = 0;
        int curr = 1;
        for(int i = sub.length()-1; i >= 0; --i) {
            val += curr*(sub[i]-'0');
            curr *= 2;
        }
        return val;
    }
public:
    bool queryString(string s, int n) {
        unsigned long long sum = n;
        sum = (sum * (sum+1))/2;
        unordered_set<int> appeared;
        for(int i = 0; i < s.length(); ++i) {
            string sub = "";
            for(int j = i; j < s.length() && j-i+1 <= 30; ++j) {
                sub.push_back(s[j]);
                int val = getVal(sub);
                if(val <= n && appeared.find(val) == appeared.end()) {
                    sum -= val;
                    appeared.insert(val);
                }
            }
        }
        return sum == 0;
    }
};
9500