PAT甲级 1152 Google Recruitment (20 分)【字符串模拟】

最新推荐文章于 2021-05-24 21:40:48 发布

原创最新推荐文章于 2021-05-24 21:40:48 发布 · 479 阅读

0 ·

CC 4.0 BY-SA版权

PAT甲级专栏收录该内容

25 篇文章

订阅专栏

2004年，谷歌在硅谷发布了一个巨型广告牌，上面写着一个数学谜题，要求找到自然常数e中第一个10位素数。本文详细解析了这个问题，并提供了一段C++代码，用于解决更一般的问题：在一个给定的L位数中，找到最早的K位素数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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位素数
如果当前的4位素数是0023，则要输出0023

分析：
输出补全k位0的方法是printf("%0*d", k, num);

错误记录：
遍历时for (int i = 0; i + k <= l; i ++)写错成了for (int i = 0; i + k < l; i ++)
对于字符串s，从第i位开始的k位数字，应该是s[i]～s[i+k-1]，而不是s[i]~s[k]

#include <iostream>
#include <vector>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;

string s;
int l, k;

bool isPrime(int num)
{
    if (num <= 1) return false;
    for (int i = 2; i <= sqrt(num);  i++)
        if (num % i == 0) return false;
    return true;
}

int main()
{
    // freopen("/Users/zhbink/Documents/C++/C++/in.txt","r",stdin);
    cin >> l >> k >> s;
    for (int i = 0; i + k <= l; i ++)
    {
        int num = stoi(s.substr(i, k));
        if (isPrime(num))
        {
            printf("%0*d\n",k , num);
            return 0;
        }
    }
    cout << "404" << endl;
    return 0;

}