<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:
    int stringtoint(string st){
        
        int ret=0;
        for(int i=st.size()-1;i>=0;i--){
            if(st[i]=='1')ret+=pow(2,st.size()-1-i);
            
            
        }
        return ret;
    }
    bool queryString(string s, int n) {
        vector<int> v;
        
       unordered_set<int> us;
            
            for(int j=0;j<s.size();j++){
                string st="";
                
                for(int i=1;i<27;i++){
                    if((i+j)-1>=s.size())break;
                    st+=s[i+j-1];
                    int a=stringtoint(st);
                    if(a==0)continue;
                    //cout<<a<<endl;
                    if(a<=n)us.insert(a);
                    v.push_back(stringtoint(st));
                    
                   
                    
                }
            }
       // cout<<endl;
           // cout<<us.size();
            if(us.size()==n)return true;
        else return false;
            
       
    }
};
21200