<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 {
    #define ll long long

    bool ispal(ll n){
        string x = "";
        while(n){
            x += ('0' + (n % 10));
            n /= 10;
        }
        ll m = x.size();
        for(ll i = 0; i < m-1; i++)if(x[i] != x[m - i - 1])return false;
        return true;
    }

    ll cnt(ll lim){
        ll n = 1e5*1ll;
        ll ans = 0;
        for(ll i = 1; i <= n; i++){
            ll val = i, p1 = i, p2 = i;
            while(val){
                p1 = p1 * 10 + (val % 10);
                val /= 10;
            }
            val = i / 10;
            while(val){
                p2 = p2 * 10 + (val % 10);
                val /= 10;
            }
            if(p1 <= lim / p1 + 1e5){
                p1 *= p1;
                if(ispal(p1) and p1 <= lim)ans++;
            }
            if(p2 <= lim / p2 + 1e5){
                p2 *= p2;
                if(ispal(p2) and p2 <= lim)ans++;
            }
        }
        // cout << ans << " ";
        return ans;
    }

public:
    int superpalindromesInRange(string left, string right) {
        return cnt(stoll(right)) - cnt(stoll(left) - 1);
    }
};
42300