PAT甲级 1152 Google Recruitment (20 分)

 

 

#include<bits/stdc++.h>
#define FI first
#define SE second

using namespace std;
typedef long long ll;

int n, k;
string s;

bool is_p(int n) {
    if(n == 0 || n == 1) return false;
    for(int i = 2; i*i <= n; ++i) {
        if(n % i == 0) return false;
    }
    return true;
}
int main() {
    cin >> n >> k >> s;
    for(int i = 0; i+k-1 < n; ++i) {
        string t = s.substr(i, k);
        int num = atoi(t.c_str());
        if(is_p(num)) {
            cout << t;
            return 0;
        }
    }
    printf("404");
    return 0;
}