USACO Training 1.6 Prime Palindromes

GeekAlice

已于 2022-10-04 14:59:31 修改

阅读量335

点赞数

分类专栏： USACO Training 文章标签：蓝桥杯 c++ 算法学习经验分享

于 2022-10-02 09:12:17 首次发布

本文链接：https://blog.csdn.net/GeekAlice/article/details/127139909

版权

USACO Training 专栏收录该内容

19 篇文章 2 订阅

订阅专栏

The number 151 is a prime palindrome because it is both a prime number and a palindrome (it is the same number when read forward as backward). Write a program that finds all prime palindromes in the range of two supplied numbers a and b (5 <= a < b <= 100,000,000); both a and b are considered to be within the range .

数字 151 是质数回文数，因为它既是质数又是回文数（向前读和向后读时是同一个数字）。编写一个程序，找出两个提供的数字 a 和 b (5 <= a < b <= 100,000,000) 范围内的所有素数回文数； a 和 b 都被认为在范围内。

PROGRAM NAME: pprime

INPUT FORMAT

Line 1:

Two integers, a and b

SAMPLE INPUT (file pprime.in)

5 500

OUTPUT FORMAT

The list of palindromic primes in numerical order, one per line.

SAMPLE OUTPUT (file pprime.out)

hint 1:

Generate the palindromes and see if they are prime.

hint 2:

Generate palindromes by combining digits properly. You might need more than one of the loops like below.

/* generate five digit palindrome: */
for (d1 = 1; d1 <= 9; d1+=2) {	/* only odd; evens aren't so prime */
    for (d2 = 0; d2 <= 9; d2++) {
        for (d3 = 0; d3 <= 9; d3++) {
	    palindrome = 10000*d1 + 1000*d2 +100*d3 + 10*d2 + d1;
	    ... deal with palindrome ...
	}
    }
}

/**
ID: choiyin1
TASK: pprime
LANG:C++
**/
#include<bits/stdc++.h> 
using namespace std;
const int maxn = 10000 + 5;
int palind[maxn];
int prime[maxn];
bool vis[maxn];
int cnt, p;
void creat_prime()
{
    p = 0;
    memset(vis, 0, sizeof(vis));
    for(int i = 2; i < maxn; i++)
    {
        if(!vis[i])
        {
            prime[p++] = i;
            int t = i;
            while(t < maxn)
            {
                vis[t] = 1;
                t = t * i;
            }
        }
    }
}
bool is_prime(int n)
{
    for(int i = 0; i < p && prime[i] < n; i++)
    {
        if(n % prime[i] == 0) return false;
    }
    return true;
}
void creat_palind()
{
    cnt = 0;
    for(int i = 2; i <= 11; i++)
        if(is_prime(i))
            palind[cnt++] = i;
    for(int i = 1; i <= 9; i += 2)//3
    {
        for(int j = 0; j <= 9; j++)
        {
            int t = i * 100 + j*10 + i;
            if(is_prime(t))
            palind[cnt++] = t;
        }
    }
    for(int i = 1; i <= 9; i += 2)//5
        for(int j = 0; j <= 9; j++)
            for(int k = 0; k <= 9; k++)
            {
                int t = i * 10000 + j * 1000 + k * 100 + j * 10 + i;
                if(is_prime(t))
                palind[cnt++] = t;
            }
    for(int i = 1; i <= 9; i += 2)//7
        for(int j = 0; j <= 9; j++)
            for(int k = 0; k <= 9; k++)
                for(int l = 0; l <= 9; l++)
                {
                    int  t = i * 1000000 + j * 100000 + k * 10000 + l *1000 + k * 100 + j * 10 + i;
                        if(is_prime(t))
                        palind[cnt++] = t;
                }
}
int main()
{
    freopen("pprime.in", "r", stdin);
    freopen("pprime.out", "w", stdout);
    creat_prime();
    creat_palind();
    int a, b; 
    while(scanf("%d%d", &a, &b) == 2)
    {
        for(int i = 0; i < cnt; i++)
        { 
            if(palind[i] >= a && palind[i] <= b)
                printf("%d\n", palind[i]);
            if(palind[i] > b) break;
        }
    }
    return 0;
}