1015

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

题解：给出两个数，一个是10进制下的值，一个是进制，求该值和该值在此进制下的翻转数（23->10111,翻转11101->29）是否都为素数。
思路：求一个数是否为素数算法：从2到sqrt（n）是否能整除。还有就是进制转换问题！！

#include <stdio.h>
#include <math.h>

int Rev(int num, int radix);
int IsPrime(int num);

int main()
{
    int num,radix;
    while(1)
    {
        scanf("%d", &num);
        if(num<0)
            break;
        else
        {
            scanf("%d", &radix);
            if(IsPrime(num) == 0)
                printf("No\n");
            else
            {
                int rev = Rev(num, radix);
                if(IsPrime(rev) == 0)
                    printf("No\n");
                else
                    printf("Yes\n");
            }
        }
    }
    return 0;
}

int Rev(int num, int radix)
{
    int len=0;
    int digit[100] = {0};
    do
    {
        digit[len++] = num % radix;
        num = num / radix;
    }while(num != 0);
    int rev = 0;
    int i;
    for(i=0;i<len;i++)
    {
        rev = rev*radix + digit[i];
    }
    return rev;
}

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