PAT(甲级)1015 Reversible Primes （20 分)

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​5​​) 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

题目大意：每次输入两个数，一个是10进制的数值，另一个是进制，每次判断这个数是否是素数，然后将这个数根据给的进制转化，然后再倒序再还原成10进制判断这个数还是不是素数，如果是的话就返回Yes不是就返回No，如果输入的是负数就结束

简析：这道题还是比较容易的，利用while判断循环的结束，每次循环都会有个输出，所以可以预先设置一个向量存储每次循环的输出，当然也可以直接输出，然后判断输入的数是否为素数。将其转化为进制数就利用取余，然后利用push_back这样可以从后往前放入，就实现了逆序，然后再从头开始复合，就能实现数字的进制化逆序再回十进制，然后判断这个数是否素数即可。

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
//判断是否是素数
bool isPrime(int num)
{
    if(num < 2)
        return false;
    else if(num == 2 || num == 3)
        return true;
    else{
        for (int i = 2; i * i <= num;i++)
        {
            if(num%i == 0)
                return false;
        }
    }
    return true;
}
int main()
{
    vector<string> output;
    int num, radix;
    cin >> num;
    while(num>0)
    {
        cin >> radix;
        //判断输入是否是素数，不是就直接循环
        if(!isPrime(num))
        {
            output.push_back("No");
            cin >> num;
            continue;
        }

        vector<int> temp;
        //进制转化
        while(num/radix !=0)
        {
            int yu = num % radix;
            temp.push_back(yu);
            num /= radix;
        }
        temp.push_back(num);
        int sum = 0;
        //转回10进制
        for (int i = 0; i < temp.size();i++)
        {
            sum = sum * radix + temp[i];
        }
        //最后判断是否素数
        if(isPrime(sum))
        {
            output.push_back("Yes");
            cin >> num;
        }else{
            output.push_back("No");
            cin >> num;
        }
    }
    for (int i = 0; i < output.size();i++)
    {
        cout << output[i] << '\n';
    }
        return 0;
}