PAT 1015. Reversible Primes (20)(d进制转化,质数判定(注意等于号))
来源:互联网 发布:访客网络加密 编辑:程序博客网 时间:2024/05/18 03:40
题目
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 (< 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
解题思路
- 1.是将这个数在d进制下反转,然后转化为十进制数,再判断它们俩是不是质数(题目有点烦),注意0,1不是质数。
AC代码
#include<iostream>#include<deque>#include<math.h>using namespace std;bool isPrim(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(int argc, char *argv[]){ int n; int tem_n; while (cin>>n) { tem_n = n; if (n<0) { return 0; } int d; cin >> d; deque<int> dq; while (n>0) { dq.push_back(n % d); n = n / d; } int reverse = 0,tp,i =0; while (!dq.empty()) { tp = dq.back(); reverse += pow(d,i) * tp; i++; dq.pop_back(); } // cout << reverse << endl; if (isPrim(reverse)&&isPrim(tem_n)) { cout << "Yes" <<endl; }else { cout << "No" << endl; } } return 0;}
- PAT 1015. Reversible Primes (20)(d进制转化,质数判定(注意等于号))
- PAT (Advanced Level) 1015. Reversible Primes (20) 翻转质数
- pat甲1015. Reversible Primes(水题)
- 1015. Reversible Primes (20)-PAT
- 【PAT】1015. Reversible Primes (20)
- PAT 1015. Reversible Primes (20)
- PAT 1015. Reversible Primes (20)
- PAT 1015. Reversible Primes (20)
- PAT 1015. Reversible Primes (20)
- PAT 1015. Reversible Primes (20)
- pat 1015. Reversible Primes (20)
- PAT 1015. Reversible Primes (20)
- PAT 1015. Reversible Primes (20)
- PAT 1015. Reversible Primes (20)
- PAT 1015. Reversible Primes (20)
- PAT 1015 Reversible Primes(进制转换+素数)
- PAT--1015. Reversible Primes
- PAT 1015. Reversible Primes
- Android 5.0 之TabLayout
- Maven 和Eclipse的整合(6)
- 工作感想-软件测试工程师
- spring-boot笔记
- [ASP.NET MVC 大牛之路]02 - C#高级知识点概要(1) - 委托和事件
- PAT 1015. Reversible Primes (20)(d进制转化,质数判定(注意等于号))
- Coursera机器学习 week2 assignment
- 微软面试100题目系列---找出字符串中第一个只出现一次的字符
- 【GDKOI2013选拔】大LCP
- Maven 和Eclipse构建web项目(7)
- Photoshop文字特效——霓虹弯管效果的文字
- [ASP.NET MVC 大牛之路]03 - C#高级知识点概要(2) - 线程和并发
- 局域网断网攻击
- 适用的字符串hash函数