A1152 Google Recruitment (判断质数)

原题：https://pintia.cn/problem-sets/994805342720868352/problems/1071785055080476672
水题，注意他说的不是每个数字是质数，是整个数是质数

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include<stack>
#include<queue>
#include<sstream>
using namespace std;

/*
A1152 Google Recruitment (20 分)
水题，注意他说的不是每个数字是质数，是整个数是质数
*/
const int MaxN = 2001;

bool isPrime(string p) {
	int num = stoi(p);
	if (num <= 1) return false;
	if (num == 2) return true;
	for (int i = 2; i * i < num; i++) {
		if (num % i == 0) return false;
	}
	return true;
}
int main() {
	int L, K;
	cin >> L >> K;
	string p,p1;
	cin >> p;
	int Find1 = 0;
	for (int i = 0; i <= L - K; i++) {
		p1 = p.substr(i, K);
		if (isPrime(p1)) { 
			Find1 = 1;
			break; }
	}

	if (Find1 == 1)
		cout << p1 << endl;
	else
		cout << "404\n";

	return 0;
}