Tous les défis
Moyen 0 résolus 0 % de réussite

Quadratic Primes

Find the quadratic n² + an + b that gives the longest run of primes from n = 0.

Ce que vous allez apprendre

  • Test primality by trial division
  • Search a two-parameter space
  • Apply tie-breaking rules

Problème

Afficher la traduction

Some quadratics are good at making primes. n² + n + 41 gives primes for n = 0 to 39. For whole numbers a and b with |a| ≤ limit and |b| ≤ limit, count how many consecutive values n = 0, 1, 2, ... make n² + an + b prime, stopping at the first value that is not prime. Find the pair with the longest run.

Implement quadratic_primes(limit).

Input

limit: The bound on the absolute values of a and b.

Output

Return [a, b, run], where run is the number of primes in the longest run. If several pairs tie, take the smallest a, then the smallest b. Numbers below 2 are not prime, so a pair whose value at n = 0 is not prime has a run of 0.

Contraintes

0 ≤ limit ≤ 300

Exemples

Exemple 1
Entrée :
limit = 3

Sortie attendue :
expected = [-2, 3, 3]
Entrée :
long long limit = 3;

Sortie attendue :
std::vector<long long> expected = {-2, 3, 3};
Entrée :
long limit = 3;

Sortie attendue :
long[] expected = new long[] {-2, 3, 3};

Explication

With a = −2 and b = 3 the values for n = 0, 1, 2, 3 are 3, 2, 3, 6: three primes. No pair does better and no smaller a ties, so the answer is [-2, 3, 3].

Exemple 2
Entrée :
limit = 1

Sortie attendue :
expected = [-1, -1, 0]
Entrée :
long long limit = 1;

Sortie attendue :
std::vector<long long> expected = {-1, -1, 0};
Entrée :
long limit = 1;

Sortie attendue :
long[] expected = new long[] {-1, -1, 0};

Explication

b is −1, 0 or 1 and none of them is prime, so every run is 0 and the smallest pair wins: [-1, -1, 0].

Comment l'aborder

Essayez d'abord seul, puis ouvrez les indices un par un.

Indice 1

At n = 0 the value is b, so b must be prime for any run at all.

Indice 2

Count n upward until the value is not prime; negative values and values below 2 end the run.

Indice 3

Loop a and b in increasing order and replace the best only on a strictly longer run.

Complexité attendue

O(limit² × run × √V) time, O(1) extra space

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

La meilleure solution validée de chaque codeur. Les plus rapides, les plus légères et les mieux notées passent devant.

Aucune solution validée pour l'instant. Résolvez-le et prenez la première place.

Apprenez des autres

Solutions de la communauté

Aucune solution publiée pour l'instant. Résolvez ce défi pour partager la première.