PAT 1152 Google Recruitment (20分)

#include<iostream>
#include<string>
#include<iomanip>
using namespace std;
string s;
bool isPrime(int n) {
	if (n <=1)return false;
	if (n == 2)return true;
	int sqr = sqrt(n);
	for (int i = 2; i < sqr + 1; i++) {
		if (n%i == 0)return false;
	}
	return true;
}
int main() {
	int N, K;
	cin >> N >> K;
	cin >> s;
	bool flag = true;
	for (int i = 0; i+K <= N; i++) {
		int n = stoi(s.substr(i, K));
		if (isPrime(n)) {
			cout << setw(K) << setfill('0') << n;
			system("pause");
			return 0;
		}
	}
	if (flag)printf("404");
	system("pause");
	return 0;
}