PAT甲级1152 Google Recruitment

题目如下

In July 2004, Google posted on a giant billboard along Highway 101 in Silicon Valley (shown in the picture below) for recruitment. The content is super-simple, a URL consisting of the first 10-digit prime found in consecutive digits of the natural constant e. The person who could find this prime number could go to the next step in Google’s hiring process by visiting this website.
The natural constant e is a well known transcendental number（超越数）. The first several digits are: e = 2.718281828459045235360287471352662497757247093699959574966967627724076630353547594571382178525166427427466391932003059921… where the 10 digits in bold are the answer to Google’s question.

Now you are asked to solve a more general problem: find the first K-digit prime in consecutive digits of any given L-digit number.

Input Specification:
Each input file contains one test case. Each case first gives in a line two positive integers: L (≤ 1,000) and K (< 10), which are the numbers of digits of the given number and the prime to be found, respectively. Then the L-digit number N is given in the next line.

Output Specification:
For each test case, print in a line the first K-digit prime in consecutive digits of N. If such a number does not exist, output 404 instead. Note: the leading zeroes must also be counted as part of the K digits. For example, to find the 4-digit prime in 200236, 0023 is a solution. However the first digit 2 must not be treated as a solution 0002 since the leading zeroes are not in the original number.

思路：
将枚举数字片段的办法和一些字符串转化等操作结合，找出最先出现的固定位数的素数（需要写一个素数判断函数），再把找出的素数转换回字符输出。
代码：

#include<iostream>
#include<string>
using namespace std;
bool isprime(int a){
	if(a==2) return true;
	else if(a<=1) return false;
	else{
		for(int i=2;i<a;i++){
			if(a%i==0) return false;
		}
		return true;
	}
}
int main(){
	int L,K;
	cin>>L>>K;
	string n;
	cin>>n;
	int ans=0;
	int i=0;
	while(i<=(L-K)){
		ans=stoi(n.substr(i,K));
		if(isprime(ans)) break;
		else i++;
	}
	if(ans==0) cout<<404;
	else{
		string anss=to_string(ans);
		for(int i=anss.length();i<K;i++){
			anss="0"+anss;
		}
		cout<<anss;
	}
	return 0;
}

但会出现最后一个测试样例超时问题

经过调试发现是isprime函数的问题，将其进行修改：

#include<iostream>
#include<string>
using namespace std;
bool isprime(int n) {
 if (n == 0 || n == 1) return false;
 for (int i = 2; i * i <= n; i++)
 if (n % i == 0) return false;
 return true;
}
/*bool isprime(int a){
	if(a==2) return true;
	else if(a<=1) return false;
	else{
		for(int i=2;i<a;i++){
			if(a%i==0) return false;
		}
		return true;
	}
}*/
int main(){
	int L,K;
	scanf("%d %d",&L,&K);
	string n;
	cin>>n;
	int ans=0;
	int i=0;
	while(i<=(L-K)){
		ans=stoi(n.substr(i,K));
		if(isprime(ans)) break;
		else i++;
        ans=0;
	}
	if(ans==0) printf("404");
	else{
		string anss=to_string(ans);
		for(int i=anss.length();i<K;i++){
			anss="0"+anss;
		}
		cout<<anss;
	}
	return 0;
}

可以通过最后一个测试点

超时的原因：
如果采用边界值1000的话，for循环的时间复杂度是10e3，然后素数判断函数时间复杂度也是10e3，所以一起的话就是10e6。而程序一般的时间复杂度在10e6就会超时。