<p>Let&#39;s say a positive integer is a <strong>super-palindrome</strong> if it is a palindrome, and it is also the square of a palindrome.</p>

<p>Given two positive integers <code>left</code> and <code>right</code> represented as strings, return <em>the number of <strong>super-palindromes</strong> integers in the inclusive range</em> <code>[left, right]</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> left = &quot;4&quot;, right = &quot;1000&quot;
<strong>Output:</strong> 4
<strong>Explanation</strong>: 4, 9, 121, and 484 are superpalindromes.
Note that 676 is not a superpalindrome: 26 * 26 = 676, but 26 is not a palindrome.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> left = &quot;1&quot;, right = &quot;2&quot;
<strong>Output:</strong> 1
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= left.length, right.length &lt;= 18</code></li>
	<li><code>left</code> and <code>right</code> consist of only digits.</li>
	<li><code>left</code> and <code>right</code> cannot have leading zeros.</li>
	<li><code>left</code> and <code>right</code> represent integers in the range <code>[1, 10<sup>18</sup> - 1]</code>.</li>
	<li><code>left</code> is less than or equal to <code>right</code>.</li>
</ul>

class Solution {
    typedef unsigned long long ull;
public:
    bool palindromes(string s) {
        int n = s.size();
        for(int i = 0; i < (n / 2); ++i) {
            if(s[i] != s[n - 1 - i]) return false;
        }
        return true;
    }
    
    int superpalindromesInRange(string left, string right) {
        ull l = stoull(left), r = stoull(right);
        vector<ull> pal;
        for(int i = 1; i < 10; ++i) pal.push_back(i);
        for(int i = 1; i < 10000; ++i) {
            string tmp = to_string(i);
            string rev = tmp;
            reverse(rev.begin(), rev.end());
            pal.push_back(stoull(tmp + rev));
            for(int i = 0; i < 10; ++i) {
                pal.push_back(stoull(tmp + to_string(i) + rev));
            }
        }
        sort(pal.begin(), pal.end());
        int res = 0;
        for(auto &p : pal) {
            ull val = p * p;
            if(val > r) break;
            if(palindromes(to_string(val))) {
                if(val >= l && val <= r) res++;
            }
        }
        return res;
    }
};
150300