Prime Numbers Generation
In this task we are going to implement the primes generator. Primes are positive integers which have
no other divisors except
1 and itself. You may read more in wiki article.
Most popular algorithms to practice are either Sieve of Eratosthene or Trial division. You
are encouraged to google for them if you need more details.
So let us create the array (or list) of prime numbers in ascending order, i.e.:
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, ...]
And then print the primes corresponding to the indices given in the input data.
Input data will contain the amount of primes to print in the first line.
Next line will contain indices of array of primes for which values should be printed. They will be in range from
Answer should contain prime numbers corresponding the specified positions of the array.
Note that for this task we start indexing an array from
1 rather than
(this may help you in checking your program with many
lists of primes which could be found online).
input data: 4 7 1 199999 4 answer: 17 2 2750131 7
Take care of implementing the algorithm efficiently - with proper approach all
200000 primes should be generated
in about a second (somewhat slower with scripting languages like Python, or older computer).