注意地方
输入的数字中找的素数是00023这种,输出也要输出00023(测试点2)
实现
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
bool isPrim(int N)
{
for (int i = 2; i <= sqrt(N); i++)
if (N%i == 0)
return false;
return true;
}
int main()
{
int N, K;
string str;
cin >> N >> K >> str;
for (int i = 0, j = K - 1; j < str.size(); j++,i++)
{
string temp = str.substr(i, K).c_str();
string ss = temp;
int num = atoi(temp.c_str());
if (isPrim(num))
{
cout << ss << endl;
return 0;
}
}
cout << "404" << endl;
return 0;
}