Sieve of Erastosthenes
Your program should read in an integer called 'n'. You should declare an array of booleans
of that size. Then you should run the
Sieve of Erastosthenes . Finally you should print out the list of prime numbers.
You get
- 5 billion points for reading the number.
- 5 billion points for allocating the array.
- 10 billion points for Doing the Seive.
- 10 Billion points if you use both a for loop and a while loop and a do-while loop in your code.
- 10 billion points for printing the answer.
- 10 billion points if your array is of size n/2 and not of size n. The array just holds odd numbers.
- -5 billion points for every day after Thr Sep 7th