2020年7月第1题 PAT甲级真题 Prime Day

最新推荐文章于 2024-11-07 18:59:45 发布

baixiaofei567

最新推荐文章于 2024-11-07 18:59:45 发布

阅读量172

点赞数

分类专栏： PAT 文章标签：算法

本文链接：https://blog.csdn.net/J_avaSmallWhite/article/details/110359752

版权

PAT 专栏收录该内容

240 篇文章 1 订阅

订阅专栏

在这里插入图片描述
The above picture is from Sina Weibo, showing May 23rd, 2019 as a very cool “Prime Day”. That is, not only that the corresponding number of the date 20190523 is a prime, but all its sub-strings ended at the last digit 3 are prime numbers.

Now your job is to tell if a given date is a Prime Day.

Input Specification:
Each input file contains one test case. For each case, a date between January 1st, 0001 and December 31st, 9999 is given, in the format yyyymmdd.

Output Specification:
For each given date, output in the decreasing order of the length of the substrings, each occupies a line. In each line, print the string first, followed by a space, then Yes if it is a prime number, or No if not. If this date is a Prime Day, print in the last line All Prime!.

Sample Input 1:
20190523

Sample Output 1:
20190523 Yes
0190523 Yes
190523 Yes
90523 Yes
0523 Yes
523 Yes
23 Yes
3 Yes
All Prime!

Sample Input 2:
20191231

Sample Output 2:
20191231 Yes
0191231 Yes
191231 Yes
91231 No
1231 Yes
231 No
31 Yes
1 No

#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdio>
using namespace std;
bool isPrime(int x){
	if(x<=1) return false;
	int Sqrt = (int)sqrt(x);
	for(int i = 2; i < Sqrt; i++){
		if(x%i == 0) return false;
	}
	return true;
}
int main(){
	string s;
	cin>>s;
	bool flag = true;
	for(int i = 0; i < s.length(); i++){
		int x = stoi(s.substr(i,s.length()-i));
		printf("%s ",s.substr(i,s.length()-i).c_str());
		if(isPrime(x) == true) cout<<"Yes\n";
		else{
			cout<<"No\n";
			flag = false;
		}
	}
	if(flag == true) cout<<"All Prime";
	return 0;
}