PAT1015. Reversible Primes (20)

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 (< 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:

73 10
23 2
23 10
-2

Sample Output:

Yes
Yes
No

下面代码需要用c++提交，c中没有bool函数，OJ显示编译错误。

#include<stdio.h>
#include<string.h>
#include<math.h>
//10进制转换成m进制
int g(int n,int m)
{
    int ans[10000];
    memset(ans,0,sizeof(ans));
    int i;
    for(i=0;;i++)
    {
        ans[i]=n%m;
        n/=m;
        if(n==0) break;
    }
    int sum=0;
    for(int j=0;j<=i;j++)
        sum=sum*m+ans[j];
    return sum;
}
//判断素数
bool prime(int n)
{
    int i,kase=1;
    if(n==1||n==0) return false;
    for(i=2;i<=sqrt(n);i++)
    {
        if(n%i==0) return false;
    }
   return true;
}
int main()
{
    int n,m;
    while(~scanf("%d",&n))
    {
        if(n<0) break;
        scanf("%d",&m);
        if(prime(n)&&prime(g(n,m)))
            printf("Yes\n");
        else printf("No\n");
    }
}