PAT
来源:互联网 发布:flash player mac版本 编辑:程序博客网 时间:2024/06/13 02:03
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 1023 223 10-2Sample Output:
YesYesNo
给定条件:
1.一个十进制数n
2.一个整数d ,1<d<=10
要求:
1.判断n是否为素数
2.判断n转换成d进制后,将数字变为“倒序”(如十进制1234倒过来为4321二进制1101倒过来为1011)然后再转换为10进制,是否为素数
3.如果两个都为素数,输出Yes否则输出No
求解:
1.按照题目要求进行编码即可
#include <cstdio>#include <vector>#include <cmath>#include <algorithm>using namespace std;int n, d, revNum;vector<int> v;bool isPrimeNum(int num) {if(num <= 1) return false;for(int i = 2; i <= sqrt(num); i++) {if(num % i == 0) {return false;}}return true;}int main() {while(scanf("%d", &n) != EOF) {if(n < 0) return 0;v.clear();scanf("%d", &d);if(isPrimeNum(n) == false) {printf("No\n");continue;}int temp = n;while(temp != 0) {v.push_back(temp%d);temp /= d;}revNum = 0;for(int i = 0; i < v.size(); i++) {revNum = revNum * d + v[i];}if(isPrimeNum(revNum)) {printf("Yes\n");} else {printf("No\n");}}return 0;}
- pat
- 【PAT】
- PAT
- PAT
- PAT
- PAT
- PAT
- PAT
- PAT
- PAT
- PAT
- pat
- PAT
- PAT
- PAT
- PAT
- PAT
- PAT
- 如何利用git制作和提交patch
- 二叉排序树的构造,插入,删除,完整c代码实现
- 机器学习之旅---SVM分类器
- Mysql 分布式集群 主从同步 读写分离 amoeba 中间件配置
- 关于Teb栏的一个小例子。
- PAT
- C++学习之路(26)---VS2015工作目录,输出目录
- int型的数到底最大值是多少?
- study post
- 【数据结构】二叉树
- SpringBoot(八)SpringBoot整合springsession实现分布式session共享
- java.lang.NoSuchMethodError: org.hibernate.engine.spi.SessionFactoryImplemen
- 求字符串的有效字符的个数
- 团体程序设计天梯赛-练习集 L1-048. 矩阵A乘以B