PAT 1152 Google Recruitment （20 分）- 甲级

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.

Sample Input 1:
20 5
23654987725541023819
Sample Output 1:
49877

Sample Input 2:
10 3
2468024680
Sample Output 2:
404

题目大意：给定一个长度为L的字符串，求出其中第一个K位的素数
分析: 枚举每个K位的子串，转换成整数，判断K是否是素数

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
using namespace std;

//判断是否为素数
bool isprime(int n){
	if(n <= 1)return false;
	int sqr = int(sqrt(1.0*n));
	for(int i = 2;i <= sqr;i++)
		if(n % i == 0)return false;
	return true;
}

//去除前导零
void dellzero(string &n){
	while(n.length() > 0 && n[0] == '0')
		n.erase(n.begin());
}

int main(){
	int l,k;
	scanf("%d %d",&l,&k);
	
	string n,temp;
	cin >> n;
	
	for(int i = 0;i <= l-k;i++){
		temp = n.substr(i,k);	//截取字符串 
		dellzero(temp);
		if(isprime(stoi(temp))){	//string类转int类 
			printf("%s",(n.substr(i,k)).c_str());	//string类转字符数组输出 
			return 0;
		}
	}
	printf("404");
	
	return 0;
}