Problema
The primes in order are 2, 3, 5, 7, 11, 13, … Given a position n, return the prime at that position. Testing numbers one by one works for small n; for the larger inputs a sieve over a range that is big enough is much faster.
Implement nth_prime(n).
Input
n: The position in the list of primes, starting at 1.
Output
Return the nth prime. nth_prime(1) is 2.
Vincoli
1 ≤ n ≤ 100,000
Esempi
Input:
n = 6
Output atteso:
expected = 13
Input:
long long n = 6;
Output atteso:
long long expected = 13;
Input:
long n = 6;
Output atteso:
long expected = 13;
Spiegazione
The primes start 2, 3, 5, 7, 11, 13, so the sixth one is 13.
Input:
n = 1
Output atteso:
expected = 2
Input:
long long n = 1;
Output atteso:
long long expected = 2;
Input:
long n = 1;
Output atteso:
long expected = 2;
Spiegazione
The first prime is 2.
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
Counting primes as you find them works, but testing every number by trial division gets slow for large n.
Suggerimento 2
The 100,000th prime is below 1,300,000, so a sieve of that size is enough.
Suggerimento 3
If your sieve turns out too small, double it and try again.
Complessità attesa
O(m log log m) time, O(m) extra space, where m is the sieve size
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.