PAT 1015. Reversible Primes (20)

最新推荐文章于 2022-02-22 19:31:52 发布

byhj

最新推荐文章于 2022-02-22 19:31:52 发布

阅读量311

点赞数

分类专栏： PAT 文章标签：浙大pat 进制转换

本文链接：https://blog.csdn.net/binyuapple/article/details/40016825

版权

PAT 专栏收录该内容

26 篇文章 0 订阅

订阅专栏

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 (< 10⁵) 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

思路：题目的意思是把数N按D进制表示，然后把所以位颠倒，再转化为10进制的数。注意原来的数也要先判断是否为素数，转化后数如果也为素数的话，输出Yes,反之，输出No

#include <iostream>
#include <algorithm>
#include <string>

using namespace std;

bool isprime(int a) //判断一个数是否为素数
{
    if (a < 2)
       return false;
    if (a==2 || a==3)
       return true;
    for (int i=2; i*i<=a; ++i)
        if (a % i == 0)
            return false;
    return true;
}

int main()
{
    int a, index;
    while (cin >> a && a>=0) {
        string s;
        cin >> index; //进制位
      if (isprime(a)) {  
        do {           //把数字直接拆位反转
            s += (a%index + '0');
            a /= index;
        }while (a);

        if ( isprime(stoi( s.c_str(), 0 ,index ) ) ) //利用stoi把字符串转化为10进制，c++11才支持此函数
            cout << "Yes" << endl;
        else
            cout << "No" << endl;
    }
    else
     cout << "No" << endl;
    }
   // system("pause");
    return 0;
}