<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 {
public:
    int superpalindromesInRange(string L, string R) 
    {
        long long a = stoll(L);
        long long b = stoll(R);
               
        int start = pow(10, max(0, (int)L.size()/4-1));
        int end = pow(10, max(0, (int)R.size()/4+1));
        
        int count = 0;
        
        for (int i=start; i<=end; i++)
        {
            for (int type = 0; type<=1; type++)
            {
                long long palin = constructPalin(i, type);
                if (palin>1e9) continue;                
                
                long long superPalin = palin*palin;
                if (superPalin>=a && superPalin<=b && isPalin(superPalin))
                    count++;
            }
        }
        
        return count;
    }
    
    long long constructPalin(long long x, int type)
    {
        long long y = x;
        if (type==1) x/=10;
        while (x>0)
        {
            y = y*10 + x%10;
            x = x/10;
        }
        return y;        
    }
    
    bool isPalin(long long x)
    {
        string s = to_string(x);
        string t = s;
        reverse(t.begin(),t.end());
        return s==t;
    }
};
70400