2020.7.25 PAT甲级7-1 Prime Day (20分)

原题链接：暂无
关键词：素数、字符串

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

题目大意： 给出一个日期，让你判断它，以及他每次减去一位后是否是素数。

分析： 从原始字符串中抠出子串转换成整数进行素数判断，简单模拟。
20分的题要熟练，动作快，20分钟内完成。

代码：

#include <bits/stdc++.h>
using namespace std;

bool isprime(int x){
	if(x < 2) return false;
	for(int i = 2; i * i < x; i ++ )
		if(x%i == 0) return false;
	return true; 
} 

int main(){
	bool flag = 1;
	string str;
	cin >> str;
	for(int i = 0; i < 8; i ++ ){
		string ans;
		ans = str.substr(i, 8-i); 	
		cout << ans << " " ;	
		
		if(isprime(stoi(ans))) cout << "Yes" << endl;
		else {
			cout << "No" << endl;
			flag = 0;
		}
	}

	if(flag) cout << "All Prime!" << endl;	
	
	return 0;
}