Reversible Primes (20)stoi应用
来源:互联网 发布:嵌入式linux终端 编辑:程序博客网 时间:2024/06/11 19: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
int stoi (const string& str, size_t* idx = 0, int base = 10);//将字符转化为整形int stol (const string& str, size_t* idx = 0, int base = 10);//将字符转化为long
int stoul (const string& str, size_t* idx = 0, int base = 10);//将字符转化为unsigned long
int stoll (const string& str, size_t* idx = 0, int base = 10);//将字符转化为long long
int stoull (const string& str, size_t* idx = 0, int base = 10);//将字符转化为unsigned long long
题意:
给定一个数N,给定一个基数D若N为素数并且将N转化为D进制后反向N’,也为素数
例如23 2
23为素数,将23转化为2进制为10111,反向后为11101是29也为素数所以输出Yes
#include<iostream>#include<string>using namespace std;bool isprime(int n)//判断素数{if(n<2)return false;for(int i=2;i<=n/2;i++)if(n%i==0)return false;return true;}int reverse(int n,int radix)//按进制反向{string s;while(n>0)//求反向radix进制数{s.push_back(n%radix+'0');n/=radix;}return stoi(s,nullptr,radix);}int main(){int n,radix;while(cin>>n&&n>= 0){cin>>radix;if(isprime(n)&&isprime(reverse(n,radix)))cout<<"Yes"<<endl;elsecout<<"No"<<endl;}return 0;}
- Reversible Primes (20)stoi应用
- 1015. Reversible Primes (20)
- 1015. Reversible Primes (20)
- 1015. Reversible Primes (20)
- 1015. Reversible Primes (20)
- 1015. Reversible Primes (20)
- 1015. Reversible Primes (20)
- 1015. Reversible Primes (20)
- 1015. Reversible Primes (20)
- 1015. Reversible Primes (20)
- 1015. Reversible Primes (20)
- 1015. Reversible Primes (20)
- 1015. Reversible Primes (20)
- 1015. Reversible Primes (20)
- 1015. Reversible Primes (20)
- 1015. Reversible Primes (20)
- 1015. Reversible Primes (20)
- 1015. Reversible Primes (20)
- Android 自定义View(三)
- NIO中ByteBuffer图解
- 记一道数学题。。。
- 在简历中使用STAR法则
- 极简的配置单节点Kubernetes(k8s)集群
- Reversible Primes (20)stoi应用
- 架构师米洛:如何让你的同事对你越来越好
- 面试/笔试数据结构之排序算法篇
- 菱形继承和虚继承
- UIButton点击动画 ---pop动画
- 1html的基本结构
- 看Kubernetes 1.5之后如何称霸容器编排管理界
- [Tarjan算法]最近公共祖先(LCA)问题求解
- apk反编译