PAT甲级1015
来源:互联网 发布:sql server的distinct 编辑:程序博客网 时间:2024/06/10 18:15
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 1023 223 10-2Sample Output:
YesYesNo
#include<cstdio>#include<vector>#include<algorithm>using namespace std;bool isPrime(int a){if (a < 2)return false;for (int i = 2; i <= sqrt(a); i++){if (a % i == 0){return false;}}return true;}bool reversePrime(int a, int radix){if (isPrime(a)){vector<int> v;do{v.push_back(a%radix);a /= radix;} while (a);int sum = 0;for (int i = 0; i < v.size(); i++){sum += v[i] * pow(radix, v.size()-1-i);}if (isPrime(sum))return true;elsereturn false;}elsereturn false;}int main(){int N, radix;while (1){scanf("%d", &N);if (N < 0)break;scanf("%d", &radix);if (reversePrime(N, radix)){printf("Yes\n");}elseprintf("No\n");}return 0;}
0 0
- PAT(甲级)1015
- PAT-甲级-1015
- PAT甲级1015
- PAT甲级1015
- PAT甲级 1015
- 浙大PAT甲级-1015
- PAT 甲级
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT(甲级)1003
- PAT(甲级)1004
- PAT(甲级)1005
- PAT(甲级)1006
- PAT(甲级)1007
- PAT(甲级)1008
- PAT(甲级)1009
- PAT(甲级)1010
- PAT(甲级)1011
- Javascript 类的公有私有
- ios 文件 pch预编译文件的配置,提供编译速度
- [hdu3507] 打印文章
- 《麦子学院深度学习应用之基础》笔记
- iOS 手工测试覆盖率率统计实践
- PAT甲级1015
- 根据大家的资源对JSON数据的学习(一)
- 蓝桥杯-基础练习 特殊的数字
- redis常用命令
- Android Studio HTTP Proxy Setting
- JS的继承
- 【开源框架】二维码生成工具类
- 断开和服务器共享连接的方法
- C#之方法