View Code of Problem 92

#include<iostream>
#include<vector>
#include<cmath>
#include<cstdio>

using namespace std;

vector<int>prime;

bool judge_su(int x)
{
    if(x<2)
        return false;
    for(int i=2;i<=sqrt(x);i++)
        {
            if(x%i==0)
               return false;
        }
    return true;
}

void judge_hui(int x)
{
    int y=x,num=0;
    while (y!=0)
    {
        num=num*10+y%10;
        y/=10;
    }
    if (num==x)
        prime.push_back(x);
    return ;
}

int main()
{
    int a,b;
    cin>>a>>b;
    for(int i=a;i<=b;i++)
    {
        if(i==9989900)  break;  //如果到了这个数，就break
        judge_hui(i);
    }
    int k=1;
    for(int i=0;i<prime.size();i++)
    {
        if(judge_su(prime[i]))
        {
            if((k++)% 5 !=0)
                printf("%6d",prime[i]);
            else
                printf("%6d\n",prime[i]);
        }
    }
    return 0;
}