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
本题思路:判断输入的n是否为素数并且当n转化为r进制时 通过反转再转化为10进制的那个数字是否为素数。如果两个都为素数即输出yes
之前做进制转化的题都是用strtol 和 itoa函数,这次发现用俩函数在pta上根本没办法编译。只好自己乖乖的学习进制转化了。
int isPrime(int n) //判断素数
{
int i;
if(n==0||n==1)
return 0;
if(n==2||n==3)
return 1;
if(n%6!=1&&n%6!=5)
return 0;
for(i=5;i*i<=n;i+=6)
{
if(n%i==0||n%(i+2)==0)
return 0;
}
return 1;
}
转化函数:
int change(int n,int r)
{
char a[100];
int t=1,i=0,sum=0;
while(n>0) //转化为r进制之后存进字符串
{
a[i++]=n%r+'0';
n/=r;
}
i-=1;
for(;i>=0;i--) //再从字符串里弹出每一位
{
sum+=(a[i]-'0')*t;
t*=r;
}
return sum;
}
完整代码如下:
#include<stdio.h>
#include<string.h>
int isPrime(int n) //判断素数
{
int i;
if(n==0||n==1)
return 0;
if(n==2||n==3)
return 1;
if(n%6!=1&&n%6!=5)
return 0;
for(i=5;i*i<=n;i+=6)
{
if(n%i==0||n%(i+2)==0)
return 0;
}
return 1;
}
int change(int n,int r)
{
char a[100];
int t=1,i=0,sum=0;
while(n>0)
{
a[i++]=n%r+'0';
n/=r;
}
i-=1;
for(;i>=0;i--)
{
sum+=(a[i]-'0')*t;
t*=r;
}
return sum;
}
int main()
{
int n,r,j;
scanf("%d",&n);
scanf("%d",&r);
while(n>=0&&r>=0)
{
int a=change(n,r);
if(isPrime(a)==1&&isPrime(n)==1) printf("Yes\n"); //如果是素数
else printf("No\n");
scanf("%d",&n); if(n<0) break;
scanf("%d",&r); if(r<0)break;
}
return 0;
}
测试点 | 结果 | 分数 | 耗时 | 内存 |
---|---|---|---|---|
0 | 答案正确 | 12 | 7 ms | 172 KB |
1 | 答案正确 | 2 | 8 ms | 276 KB |
2 | 答案正确 | 4 | 10 ms | 188 KB |
3 | 答案正确 | 2 | 20 ms | 372 KB |