文章目录
强烈推荐,刷PTA的朋友都认识一下柳神–PTA解法大佬
本文由参考于柳神博客写成
PS
题目原文
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
生词如下:
reversible 可逆的
radix 进制
题目大意
就是给你一个N和一个D
N是一个十进制的整数.D是进制.
问你N是不是素数.还有把N转换成D进制,然后再逆置,再问你,逆置后的数字是不是素数.
如果是就输出Yes,不是就输出No
举个例子.
23是素数,把它转换成2进制.就是10111.
再进行逆置. 11101.
11101就是29,29也是素数,所以可以输出Yes
思路如下:
就是先判断N是不是素数.然后再判断转换后的数字,
我是通过一系列的换算算出来的.
比较的麻烦.
要注意的就是-
测试点1 不过的原因,就是1不是素数.这个一定要再判断素数的函数里面写清楚.
代码如下:
#include<iostream>
#include<vector>
#include <stdlib.h>
#include<cmath>
#include <string>
#include<algorithm>
using namespace std;
bool isPrime(int N);
bool transFrom(int N, int D);
int main(void) {
vector<string> Data;
int N = 1, D = 1;
while (true) {
cin >> N;
if (N < 0) {
break;
}
cin >> D;
if (transFrom(N, D)) {
Data.push_back("Yes");
}
else {
Data.push_back("No");
}
}
for (auto i = Data.begin(); i < Data.end(); ++i) {
if (i != Data.begin()) cout << "\n";
cout << *i;
}
return 0;
}
bool transFrom(int N, int D) {
if (isPrime(N)) {
string revers;
int revers_number = 0, index = 0;
if (D != 10) {
while (N != 0) {
revers += to_string(N % D);
N = N / D;
}
N = atoi(revers.c_str());
while (N != 0) {
int t = 0;
t = N % 10;
revers_number += (pow(D, index) * t);
index++;
N = N / 10;
}
}
else {
revers = to_string(N);
reverse(revers.begin(), revers.end());
revers_number= atoi(revers.c_str());
}
if (isPrime(revers_number))
return true;
}
return false;
}
//判断一个数字是不是素数.
bool isPrime(int N) {
for (int i = 2; i * i <= N; i++) {
if (N % i == 0)
return false;
}
if (N == 1)
return false;
return true;
}
柳神的代码如下:
#include <cstdio>
#include <cmath>
using namespace std;
bool isprime(int n) {
if (n <= 1) return false;
int sqr = int(sqrt(n * 1.0));
for (int i = 2; i <= sqr; i++) {
if (n % i == 0)
return false;
}
return true;
}
int main() {
int n, d;
while (scanf("%d", &n) != EOF) {
if (n < 0) break;
scanf("%d", &d);
if (isprime(n) == false) {
printf("No\n");
continue;
}
int len = 0, arr[100];
do {
arr[len++] = n % d;
n = n / d;
} while (n != 0);
//柳神的老方法了.专门用来转换进制的.自己写的时候,忘记了.
for (int i = 0; i < len; i++)
n = n * d + arr[i];
printf("%s", isprime(n) ? "Yes\n" : "No\n");
}
return 0;
}
如果这篇文章对你有张帮助的话,可以用你高贵的小手给我点一个免费的赞吗
相信我,你也能变成光.
如果你有任何建议,或者是发现了我的错误,欢迎评论留言指出.