USACO SECTION 1.5 Prime Palindromes

最新推荐文章于 2023-03-16 18:22:25 发布

zztant

最新推荐文章于 2023-03-16 18:22:25 发布

阅读量270

点赞数

分类专栏： USACO 文章标签： output numbers file input 优化 list

本文链接：https://blog.csdn.net/zztant/article/details/7803746

版权

USACO 专栏收录该内容

86 篇文章 0 订阅

订阅专栏

Prime Palindromes

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 .

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)

Test 1: TEST OK [0.000 secs, 2340 KB]

Test 2: TEST OK [0.000 secs, 2340 KB]

Test 3: TEST OK [0.032 secs, 2340 KB]

Test 4: TEST OK [0.032 secs, 2340 KB]

Test 5: TEST OK [0.032 secs, 2340 KB]

Test 6: TEST OK [0.032 secs, 2340 KB]

Test 7: TEST OK [0.043 secs, 2340 KB]

Test 8: TEST OK [0.032 secs, 2340 KB]

Test 9: TEST OK [0.832 secs, 2340 KB]

/*
ID: conicoc1
LANG: C
TASK: pprime
*/

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>

int A[9]={
		1,10,100,1000,10000,100000,1000000,10000000,100000000
	};
int Answer[10000];
int k=0;
int a,b;
int Length;

int count=0;

int IsPrime(int Number)
{
	int i;
	double TempNumber;
	TempNumber=(double)Number;
	if(Number%2==0)
		return 0;
	for(i=3;i<=sqrt(TempNumber);i+=2)
	{
		if(Number%i==0)
			return 0;
	}
	return 1;		
}

void FindPalindromes(int Sum,int Length,int N)  //长度为Length回文的第N位 
{
	int i;
	int temp;
//	printf("%d\n",count++);
	if(N>Length/2)   //说明是递归的最后一次 
	{
		for(i=0;i<=9;i++)
		{
			if(Length%2==0)  //如果是偶数
			{
				temp=Sum+i*A[N-1]+i*A[Length-N];
				if(IsPrime(temp)&&temp>=a&&temp<=b)
					Answer[k++]=temp;		
			}
			else
			{
				temp=Sum+i*A[N-1];
				if(IsPrime(temp)&&temp>=a&&temp<=b)
					Answer[k++]=temp;
			}
		} 
	}
	else
	if(N==1)
	{
		for(i=1;i<=9;i+=2)
		{
			FindPalindromes(Sum+i*A[Length-1]+i*A[N-1],Length,N+1);
		}
	}
	else
	{
		for(i=0;i<=9;i++)
		{
			FindPalindromes(Sum+i*A[N-1]+i*A[Length-N],Length,N+1);
		}
	}
	
}

int main()
{
	FILE *fin,*fout;
	fin=fopen("pprime.in","r");
	fout=fopen("pprime.out","w");

	fscanf(fin,"%d %d",&a,&b);
	
	int Length=0;
	int temp=b;
	
	while(temp!=0)
	{
		Length++;
		temp/=10;
	}
	
	for(count=1;count<=Length;count++)	
		FindPalindromes(0,count,1);  //长度为Length回文的第N位
	
	for(count=0;count<k;count++)
		fprintf(fout,"%d\n",Answer[count]);
		
	return 0;
}

一开始用爆搜果断跪了，所以先找回文。

用深搜，打印出来直接是有序的，应该还可以减枝

貌似判断素数还可以优化