<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>

using LL = long long;
class Solution {
public:
    int superpalindromesInRange(string left, string right) {
        LL l = stoll(left);
        LL r = stoll(right);
        int cnt = 0;
        for(int i=1; i<=1e5; i++){
            for(int type=0; type<2; type++){
                LL palindrome = get_palindrome(i, type);
                if(palindrome>1e9) continue;
                
                LL super_palindrome = palindrome*palindrome;
                if(super_palindrome<l || super_palindrome>r) continue;

                if(!is_palindorme(super_palindrome)) continue;

                cnt++;
            }
        }
        return cnt;
    }

    LL get_palindrome(LL n, int type){
        LL left = n;
        LL right = 0;
        if(type==1) n/=10;
        while(n){
            left = left*10;
            right = right*10 + n%10;
            n/=10;
        }
        return left + right;
    }

    bool is_palindorme(LL num){
        string s = to_string(num);
        int n = s.size();
        int l = 0;
        int r = n-1;
        while(l<r){
            if(s[l]!=s[r]) return false;
            l++;
            r--;
        }
        return true;
    }
};
40400