Thenaturalconstant e isawellknowntranscendentalnumber（超越数）.Thefirstseveraldigitsare: e =2.718281828459045235360287471352662497757247093699959574966967627724076630353547594571382178525166427427466391932003059921...wherethe10digitsinboldaretheanswertoGoogle'squestion.
Nowyouareaskedtosolveamoregeneralproblem:findthefirstK-digitprimeinconsecutivedigitsofanygivenL-digitnumber.
InputSpecification:
Eachinputfilecontainsonetestcase.Eachcasefirstgivesinalinetwopositiveintegers:L(≤ 1,000)andK(< 10),whicharethenumbersofdigitsofthegivennumberandtheprimetobefound,respectively.ThentheL-digitnumberNisgiveninthenextline.
OutputSpecification:
Foreachtestcase,printinalinethefirstK-digitprimeinconsecutivedigitsofN.Ifsuchanumberdoesnotexist,output 404 instead.Note:theleadingzeroesmustalsobecountedaspartoftheKdigits.Forexample,tofindthe4-digitprimein200236,0023isasolution.Howeverthefirstdigit2mustnotbetreatedasasolution0002sincetheleadingzeroesarenotintheoriginalnumber.
SampleInput1:20523654987725541023819SampleOutput1:49877SampleInput2:1032468024680SampleOutput2:404#include<iostream>#include<string>#include<sstream>#include<vector>#include<algorithm>#include<cmath>usingnamespacestd;//11:06boolisp(inta){if(a<=1)returnfalse;intk=pow(a,0.5);for(inti=2;i<k;i++){if(a%i==0)returnfalse;}returntrue;}intmain(){//freopen("C:\\Users\\chenzhuo\\Desktop\\in.txt","r",stdin);intn,m;cin>>n>>m;strings;cin>>s;for(inti=0;i<=n-m;i++){stringstr=s.substr(i,m);stringstreamss;ss<<str;inttmp;ss>>tmp;if(isp(tmp)){cout<<str;return0;}}cout<<"404";}
