Description
Rikhail Mubinchik believes that the current definition of prime numbers is obsolete as they are too complex and unpredictable. A palindromic number is another matter. It is aesthetically pleasing, and it has a number of remarkable properties. Help Rikhail to convince the scientific community in this!
Let us remind you that a number is called prime if it is integer larger than one, and is not divisible by any positive integer other than itself and one.
Rikhail calls a number a palindromic if it is integer, positive, and its decimal representation without leading zeros is a palindrome, i.e. reads the same from left to right and right to left.
One problem with prime numbers is that there are too many of them. Let's introduce the following notation: π(n) — the number of primes no larger than n, rub(n) — the number of palindromic numbers no larger than n. Rikhail wants to prove that there are a lot more primes than palindromic ones.
He asked you to solve the following problem: for a given value of the coefficient A find the maximum n, such that π(n) ≤ A·rub(n).
Input
The input consists of two positive integers p, q, the numerator and denominator of the fraction that is the value of A (, ).
Output
If such maximum number exists, then print it. Otherwise, print "Palindromic tree is better than splay tree" (without the quotes).
Sample Input
1 1
40
1 42
1
6 4
172
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define M 2000008
using namespace std;
double p,q;
bool prim[M];
int ans,a,b;
void pri()//打出素数表
{
int i,j;
prim[1]=false;
for(i=2;i<M;i++)
{
if(!prim[i])
continue;
prim[i]=true;
for(j=2;j*i<M;j++)
prim[i*j]=false;
}
}
bool init(int n)//判断回文数
{
int k=0;
int m=n;
while(m)
{
k*=10;
k+=m%10;
m=m/10;
}
if(k==n)
return true;
return false;
}
int main()
{
memset(prim,true,sizeof(prim));
pri();
while(scanf("%lf%lf",&p,&q)!=EOF)
{
double A=p/q;
a=b=0;
for(int i=1;i<M;i++)//暴力枚举
{
a+=prim[i];
b+=init(i);
if(a<=A*b)
ans=i;
}
printf("%d\n",ans);
}
return 0;
}