Codeforces Round #315 (Div. 2)569C Primes or Palindromes?(预处理)

关注

原创最新推荐文章于 2026-02-20 02:23:58 发布 1.5k 阅读 AI 写同款· GEO 优化 ›

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 ( $\text{[math]}$ , $\text{[math]}$ ).

Output

If such maximum number exists, then print it. Otherwise, print "Palindromic tree is better than splay tree" (without the quotes).

Sample test(s)

input
1 1

output
40

input
1 42

output
1

input
6 4

output
172

最大的A是42，n大于1200000则π(n) > A·rub(n)。回文数比较少，把所有回文数都保存到数组中，接着保存素数到数组中，

最后判断条件即可。

AC代码：

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
#include "cmath"
using namespace std;
const int MAXN = 1200005;
int a[MAXN], prim[MAXN], hw[MAXN], p, q;
int judge(int k)
{
	int len = 0;
	char c[10];
	while(k > 0) {
		c[len++] = char(k % 10 + '0');
		k /= 10;
	}
	for(int i = 0; i < len / 2; ++i)
		if(c[i] != c[len - i - 1]) return 0;
	return 1;

}
int main(int argc, char const *argv[])
{
	for(int i = 1; i <= 1200000; ++i)
		hw[i] = hw[i - 1] + judge(i);
	scanf("%d%d", &p, &q);
	for(int i = 2; i <= sqrt(1200000); ++i) {
		if(!a[i])
			for(int j = i * 2; j <= 1200000; j += i) {
				a[j] = 1;
				prim[i] = 1;
			}
		prim[i] += prim[i - 1];
	}
	for(int i = sqrt(120000) + 1; i <= 1200000; ++i)
		prim[i] = prim[i - 1] + (!a[i]);
	for(int i = 1200000; i >= 0; --i)
		if(prim[i] <= double(hw[i] * p / q)) {
			printf("%d\n", i);
			return 0;
		}
	printf("Palindromic tree is better than splay tree\n");
	return 0;
}

收录于