zju pat 1015
2015-02-25 22:06
218 查看
#include <iostream> #include <string.h> #include <math.h> using namespace std; bool prime(int num) { int i; if(num ==0 || num ==1) return false; for(i=2;i<=sqrt(double(num));i++) { if(num % i ==0) return false; } return true; } int convert(int n,int d) { int sum =0; while(n!=0) { sum = sum*d + n %d; n = n/d; } return sum; } int main() { int n,d; while(cin>>n) { if(n<0) break; cin>>d; if(prime(n) && prime(convert(n,d))) cout<<"Yes"<<endl; else cout<<"No"<<endl; } return 0; }
相关文章推荐
- ZJU PAT 1015 德才论
- 1015. 德才论 (25) (结构体啊 ZJU_PAT)
- EASY_PAT_ZJU_ADVANCED LEVEL 1015 进制转换 素数
- zju pat 1015
- PAT乙级 (Basic Level) Practise - 1015 德才论
- 编程题目: PAT 1015. 德才论 (25)
- PAT-1015 Reversible Primes (20)
- 2-12. 两个有序链表序列的交集(20) (ZJU_PAT 链表 | vector)
- ZJU PAT 1004
- 1016. 部分A+B (15) (数学啊 ZJU_PAT)
- 3-07. 求前缀表达式的值(25) (ZJU_PAT数学)
- PAT 1015. 德才论
- http://pat.zju.edu.cn/contests/pat-practise/1023
- http://pat.zju.edu.cn/contests/pat-practise/1004
- ZJU PAT 1004 Counting Leaves
- pat测试1015 德才论。运行超时 标库耗时过大,用cstdio
- PAT甲级1015
- zju pat 1052
- Pat(Advanced Level)Practice--1015(Reversible Primes)
- ZJU_PAT BASIC LEVEL _ 1019 数字的分解与排序