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
思路
这题很简单哈,直接对读入的字符串进行操作:从当前位i开始切割K位,然后用stoi()函数转化成int型,对其判断是否是一个素数即可~
这里主要有两个坑:
- for循环的上限不是str.length(),因为下面要用到substr()函数,试想,如果读到最后一位,但是K=4,又要切割四位,那么是会出问题的。因此最大应该到length()-K这个位置(该位置可取,是闭区间),这是测试点3的问题;
- L并不等于字符串的长度str.length(),因此上限应该写L-K,否则测试点4就会错(这个感觉很奇怪,明明题目说明了给出的字符串长度就是L位,而且它最大也就1000位,直接用length()函数不知道为什么不行…);
代码
#include<cstdio>
#include<math.h>
#include<stdlib.h>
#include<algorithm>
#include<string.h>
#include<iostream>
using namespace std;
bool isPrime(int x){
if(x<=1) return false;
int sqr = (int)sqrt(x*1.0);
for(int i=2;i<sqr;i++){
if(x%i==0) return false;
}
return true;
}
int main()
{
int L, K;
cin>>L>>K;
string str;
cin>>str;
bool flag = false;
for(int i=0;i<=L-K;i++){
string tmp = str.substr(i, K);
if(isPrime(stoi(tmp))==true){
cout<<tmp;
flag = true;
break;
}
}
if(flag==false) cout<<"404";
return 0;
}