PAT(Advanced Level) 1015 - Reversible Primes(水题)

最新推荐文章于 2023-01-01 16:01:19 发布

Snakeflute

最新推荐文章于 2023-01-01 16:01:19 发布

阅读量303

点赞数

本文链接：https://blog.csdn.net/Snakeflute/article/details/53488858

版权

PAT-A 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

*1015. Reversible Primes (20)

时间限制
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:
73 10
23 2
23 10
-2
Sample Output:
Yes
Yes
No

题意：
给出一个n和一个d，将n化为d进制，再把d进制的那个数反过来用d进制变成10进制为m，问n和m是否同为素数。

解题思路：
模拟。

AC代码：

#include<bits/stdc++.h>
using namespace std;
int a[10005];
bool isPrime(int n)
{
    if(n < 2)   return 0;
    for(int i = 2;i <= sqrt(n);i++)
        if(n%i == 0)    return 0;
    return 1;
}
int main()
{
    int n,d;
    while(~scanf("%d",&n)&&n >= 0)
    {
        scanf("%d",&d);
        int tmp = n;
        int len = 0;
        while(tmp)  a[len++] = tmp%d,tmp/=d;
        int sum = 0;
        int digit = 1;
        for(int i = len-1;i >= 0;i--) sum += a[i]*digit,digit *= d;
        if(isPrime(n) && isPrime(sum))  printf("Yes\n");
        else                            printf("No\n");
    }
    return 0;
}