HIT oj题解1004 - Prime Palindromes

该博客介绍了如何解决HIT在线判题系统中的1004题,即在给定范围内找到所有的素数回文数。题目要求在5到1亿之间的a和b(5<=a<b<=1000,000,000)中找出素数回文数,并按升序输出。示例输入5和500,输出包括5、7、11等回文素数。" 111600929,10361131,JavaScript与jQuery选择器详解,"['JavaScript', 'jQuery', '选择器']
摘要由CSDN通过智能技术生成

**
HIT oj题解1004 - Prime Palindromes

**
http://acm.hit.edu.cn/problemset/1004
Problem Description

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 <= 1000,000,000); both a and b are considered to be within the range .
Input

Line 1: Two integers, a and b
Output

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

5 500

Sample Output

5

7

11

101

131

151

181

191

313

353

373

383

solution:

#include <stdio.h>
int prime(int x)
{
	if(x%2 == 0)
	    return 0;
	int i;
	for(i &#
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值