后3个WA求助

#include<iostream>

#include<bitset>

#include<algorithm>

#include<vector>

using namespace std;

auto getPrimeList()

{

    const unsigned int maxNum = 10000000;

    bitset<maxNum> compositeTagList;

    vector<unsigned int> primeList = {};

    for (unsigned int i = 2; i < maxNum; i += 1)

    {

        if (compositeTagList[i] == false)

        {

        for (unsigned long int j = i * i; j < maxNum; j += i)

        {

            if (compositeTagList[j] == false)

                compositeTagList[j] = true;

        }

        primeList.push_back(i);

        }

    }

    return primeList;

}

auto primeList = getPrimeList();

auto isPalindrome(unsigned int x)

{

    if (x % 10 == 0 && x != 0) return false;

    unsigned int revertedNum = 0;

    while (x > revertedNum)

    {

        revertedNum = revertedNum * 10 + x % 10;

        x /= 10;

    }

    return x == revertedNum || x == revertedNum / 10;

}

int main()

{

    unsigned int a, b;

    cin >> a >> b;

    for (const unsigned int &x: primeList) {

        if(a <= x && x <= b && isPalindrome(x))

        {

            cout << x << endl;

        }

    }

    return 0;

}