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

#define size_t unsigned long long int 
class Solution {
public:
    int superpalindromesInRange(string lefts, string rights) {
        size_t left = toNumber(lefts);
        size_t right= toNumber(rights);
        size_t start = 1, end = 1e5;
        int ans = 0;
        
        //for odd length
        while(start <= end){
            string str = to_string(start);
            string temp = str;
            reverse(temp.begin(),temp.end());
            str = str + temp.substr(1);
            size_t num = toNumber(str);
            num *= num;
            if(num > right)break;
            if(num >= left and isPalindrome(num))
                ++ans;
            ++start;
        }
        
        start = 1;
        
        //for even length
         while(start <= end){
            string str = to_string(start);
            string temp = str;
            reverse(temp.begin(),temp.end());
            str = str + temp;
            size_t num = toNumber(str);
            num *= num;
            if(num > right)break;
            if(num >= left and isPalindrome(num))
                ++ans;
             ++start;
        }
        
        return ans;
        
    }
	 size_t toNumber(string str){
        size_t ans = 0;
        for(auto it : str){
            ans = ans*10 + (it-'0');
        }
        return ans;
    }
    
    string to_string(size_t num){
        string str = "";
        while(num){
            str += ((num%10) + '0');
            num /= 10;
        }
        reverse(str.begin(),str.end());
        return str;
    }
    
    bool isPalindrome(size_t num){
        string str = to_string(num);
        string temp = str;
        reverse(temp.begin(),temp.end());
        return str == temp;
    }
    
};
69100