Write a C++ program which:
1. takes an integer n ≥ 0 from stdin provided by the user.
2. creates a string concat primes of length 1000 from the first k prime numbers by concatenating them as strings. (You have to decide on the value of k).
3. The program has to compile and work perfectly in visual studio or xcode (mac)
4. prints the first 5 characters of concat primes starting at index n.
For example, the first k prime numbers are 2, 3, 5, 7, 11, 13, 17.... Thus, concat primes = "2357111317...". If the user provides n = 3, the program should print 71113.
A sample of expected output for various values of n is given below:
n Output
0 = 23571
3 = 71113
6 = 13171
10 = 19232
120 = 92332
998 = 91
Using this format
#include
#include
std::string get_concatenated_primes()
{
return "2357111317";
}
std::string get_slice_of_5(const std::string & primes, const int index)
{
return "23571";
}
int main()
{
int n;
while(std::cin >> n)
{
std::string concat_primes = get_concatenated_primes();
std::cout << get_slice_of_5(concat_primes, n) << std::endl;
}
return 0;
}