PAT_1015.Reversible Primes

// 1015_Reversible Primes.cpp : 定义控制台应用程序的入口点。
//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



#include "stdafx.h"
#include "stdio.h"
#include "iostream"
#include "string.h"
#include "stdlib.h"
#include "string"
#include "algorithm"
#include "math.h"
using namespace std;

int is_prime(int num){
    for(int i = 2;i<=sqrt(num*1.0);i++){
        if(!(num%i))
            return 0;
    }
    return 1;
}

int main()
{
    int n,d;
    while(cin>>n>>d && n>=0){
        int flag = 0;
        if(is_prime(n) && n!=1){
            int ans[100];
            int cursor=0;
            while(n){
                ans[cursor++] = n%d;
                n /= d;
            }
            int i = 0;
            while(!ans[i++]){}
            int result = 0;
            i--;
            while(i<cursor){
                result *= d;
                result += ans[i++];
            }
            if(is_prime(result) && result!=1){
                cout<<"Yes"<<endl;
                flag = 1;
            }
        }
        if(!flag)
            cout<<"No"<<endl;
    }
    return 0;
}

/*

规定1不是素数

*/