PAT A1015. Reversible Primes (20)

最新推荐文章于 2024-10-13 16:52:53 发布

阿豪boy

最新推荐文章于 2024-10-13 16:52:53 发布

阅读量96

点赞数

文章标签：算法 python leetcode c++ java

本文链接：https://blog.csdn.net/qq_35516360/article/details/122067478

版权

原文链接: PAT A1015. Reversible Primes (20)

上一篇: PAT B1034. 有理数四则运算(20)

下一篇: PAT A1078. Hashing (25)

1015. Reversible Primes (20)

https://www.patest.cn/contests/pat-a-practise/1015

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

A reversible prime in any number system is a prime whose "reverse" in that number system is also a prime. For example in the decimal system 73 is a reversible prime because its reverse 37 is also a prime.

Now given any two positive integers N (< 105) and D (1 < D <= 10), you are supposed to tell if N is a reversible prime with radix D.

Input Specification:

The input file consists of several test cases. Each case occupies a line which contains two integers N and D. The input is finished by a negative N.

Output Specification:

For each test case, print in one line "Yes" if N is a reversible prime with radix D, or "No" if not.

Sample Input:

Sample Output:

Yes
Yes
No

#include <iostream>
#include <cstdio>
#include <cmath>

using namespace std;

int isPrime(int n) {
	if (n < 3)
		return n > 1;

	int sqr = sqrt(1.0*n);
	for (int i = 2; i <= sqr; i++)
		if (n%i == 0)
			return 0;
	return 1;
}
//存放数字位数 
int d[111];
int main(int argc, char *argv[]) {
	int n, radix;
	while (scanf("%d", &n) != EOF && n >= 0) {
		scanf("%d", &radix);
		if (!isPrime(n))
			printf("No\n");
		else {
			int len = 0;
			do {
				d[len++] = n%radix;
				n /= radix;
			} while (n);
			for (int i = 0; i < len; i++)
				n = n*radix + d[i];
			if (isPrime(n))
				printf("Yes\n");
			else
				printf("No\n");
		}
	}
	return 0;
}