Write a program to find the first 10 digit prime found in consecutive digits of e. Start with the attached program which, among other things, defines e with more than enough digits to solve the problem. The header file defines a function called clock(). You can time how long something lasts like this: clock_t start = clock(); // do something here that takes time, like looking for a prime number int clockticks = clock() - start; It is possible to translate clockticks into seconds.

Can anyone help me finish this C++ program also I need to use the code below

#include

#include

using namespace std;

#if defined(WIN32)

typedef __int64 longlong;

#else typedef long long longlong;

#endif

string e = "2718281828459045235360287471352662497757247093699959574966967" "6277240766303535475945713821785251664274274663919320030599218174" "1359662904357290033429526059563073813232862794349076323382988075" "3195251019011573834187930702154089149934884167509244761460668082" "2648001684774118537423454424371075390777449920695517027618386062" "6133138458300075204493382656029760673711320070932870912744374704" "7230696977209310141692836819025515108657463772111252389784425056" "9536967707854499699679468644549059879316368892300987931277361782" "1542499922957635148220826989519366803318252886939849646510582093" "9239829488793320362509443117";

longlong strtolonglong(string s)

{

}

bool isprime(longlong candidate)

{

}