【PAT刷题甲级】1152.Google Recruitment

最新推荐文章于 2022-02-11 10:27:53 发布

C_greenbird

最新推荐文章于 2022-02-11 10:27:53 发布

阅读量176

点赞数

分类专栏： PAT甲级文章标签：素数编程挑战算法数字处理字符串操作

本文链接：https://blog.csdn.net/C_greenbird/article/details/119810132

版权

PAT甲级专栏收录该内容

73 篇文章 0 订阅

订阅专栏

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

Sample Input 2

10 3
2468024680

Sample Output 2

题意

给一个长度为L的数，输出其中第一个长度为K的素数。

代码

#include <iostream>
#include <cmath>
#include <string>
using namespace std;
bool isprime(long long n) {
	if(n<=1)	return false;
	long long sqr=(long long)sqrt(1.0*n);
	for(long long i=2; i<=sqr; i++) {
		if(n%i==0)	return false;
	}
	return true;
}
char n[1001];
int main() {
	int l,k,flag=0;
	cin >> l >> k >> n;
	string tmp;
	for(int i=0; i<=l-k; i++) {
		for(int j=i; j<i+k; j++) {
			tmp+=n[j];
		}
		long long t=stoll(tmp);
		if(isprime(t)) {
			flag=1;
			cout << tmp;
			break;
		}
		tmp="";
	}
	if(flag==0)	printf("404");
	return 0;
}