1152 Google Recruitment (20 point(s))

思路：

字符串转成10进制数，再判断是否素数，如果是则输出，前导0也要输出，即输出 0023 而不是 23.

1152 Google Recruitment (20 point(s))

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.

Example:

#include<iostream>
#include<cstring>
using namespace std;

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

int main()
{
    int L, K;
    cin >> L >> K;
    char n[2000];
    scanf("%s", n);
    int len = strlen(n);
    for(int begin = 0, end = K; end <= len; begin++, end++) {
        char temp = n[end];
        char *p;
        n[end] = '\0';
        long long num = strtoll(&n[begin], &p, 10);
        if(isPrime(num)) {
            printf("%s\n", &n[begin]);
            return 0;
        }
        n[end] = temp;
    }
    cout << "404\n";
}