Grands gagnants du concours Acceler8



Les vainqueurs du problème n°2 du concours Acceler8, et classement général

Vous les avez attendus , et aujourd'hui ils sont enfin là ! Sans vous faire trop attendre, les résultats sont dans l'ordre,
pour les 6 premiers du deuxième problème.

D'abord, un petit rappel du problème :

2ième problème : ( Mis à jour avec les élèments en gras )

"Sums and Products of Primes

A pair of consecutive primes are two prime numbers that have no other prime between them. The idea of consecutive primes can be extended to any number k, in which there are only k primes between and including the smallest and largest primes of the ordered set. Two examples of 3-consecutive prime sets would be [29, 31, 37] and [11083, 11087, 11093]. One interesting fact about these two sets is that the product of the values in the first set is equal to the sum of the values of the second set. That is,


29 * 31 * 37 = 11083 + 11087 + 11093 = 33263.


Unfortunately, such pairs of k-consecutive prime sets are few and far between.

Problem Description: Write a threaded program to identify k-consecutive primes whose product is close to the sum of a set of k-consecutive primes within an input range. Input to the program will be the range to search for consecutive primes to be multiplied, the size of consecutive prime sets, k, to be used, and the maximum difference tolerated between the two computed values. Output from the program will be all qualifying pairs of k-consecutive prime sets and the values of the product and sum. ( k min = 2 )

Input Description: The input to the program will be four positive integers on the application's command line. The first two integers are the lower and upper bounds (inclusive) of the range to search for consecutive prime sets that will be multiplied together. The third value will be the number of consecutive primes, k, to be included in sets formed and examined by the solution. The product of any k-consecutive primes within the range can be represented by a 64-bit integer. The fourth value will be the allowed maximum difference between the product and the sum of values that will permit the output of the two k-consecutive prime sets. The fourth value should be inferior to 2^15-1.


Output Description: The output to be generated by the application is the two k-consecutive prime sets and the value of the product and sum, respectively, of the pairs. Each pair of sets and computed values should appear on a single line. All output will be printed to stdout.


Input command line example: ./cprimes 2 50 2 1


Output example:

2-consecutive prime sets with product/sum difference of 1

[2 3] 6 [2 3] 5

[41 43] 1763 [881 883] 1764

[5 7] 35 [17 19] 36

[11 13] 143 [71 73] 144

[31 37] 1147 [571 577] 1148

[13 17] 221 [109 113] 222

[37 41] 1517 [757 761] 1518

[7 11] 77 [37 41] 78

[43 47] 2021 [1009 1013] 2022

[23 29] 667 [331 337] 668


Timing: The total execution time of the application will be used for scoring. For most accurate timing results, submission codes would include timing code to measure and print total execution time to stdout, otherwise an external stopwatch will be used to measure the entire execution time.



Classement du deuxième problème


Place
Etudiant 1 Etudiant 2
Professeur Ecole Points
1 Vincent Reverdy(VinceRev) Arnaud Reverdy(ar1991) Yann Rasera Phelma (Grenoble-INP) / UJF M2R AMD 150
2 Mihai Moraru Thibaut Patel(thib) Marian Scuturici INSA Lyon 130
3 Fabien Arcellier(farcellier) Maxime Riviere(rimaxime) Pascal Gelly
EMSE 85
4
Marouane Belaoucha
Mouad Bahi
Sofiane Abbar
UVSQ
50
5
Achille Roussel
Hadrien Blanc
Majdi Toumi
Epitech 35
6 Remi Arnaud
Paul Arnaud
Thierry Grandpierre
ESIEE
20



Mes sincères félicitations à ces 6 équipes qui gagnent donc un netbook par personne.

Je vous rappele que comme le stipule le règlement, les vainqueurs doivent mettre à disposition leur code et leur readme à disposition des autres membres de la communauté au travers un article sur l'ISN. ( plus d'informations ici : Comment devenir blogueur sur le site Intel ? )

Merci d'envoyer vos adresses avec nom/prénom/adresse exacte à ISNfrance@intel.com pour que nous puissions vous faire parvenir les lots, ou alors de convenir d'une date pour passer les chercher à nos bureaux parisiens ( à Meudon exactement). Nous allons aussi revenir rapidement par e-mail vers les vainqueurs.



Maintenant, le Classement général


Place
Etudiant 1 Etudiant 2
Professeur Ecole Points Total

Vincent Reverdy(VinceRev) Arnaud Reverdy(ar1991) Yann Rasera Phelma (Grenoble-INP) / UJF M2R AMD 130+150 = 280
2 Mihai Moraru Thibaut Patel(thib) Marian Scuturici INSA Lyon 140 + 130 = 270
3 Fabien Arcellier(farcellier) Maxime Riviere(rimaxime) Pascal Gelly
EMSE 70+85=155


Les grands gagnants s'appelent donc Vincent Reverdy & Arnaud Reverdy, un grand bravo à eux !
Ils gagnent le gros lot à savoir les 2 PC portables professionnels.

Mise à jour à suivre.




Para obtener más información sobre las optimizaciones del compilador, consulte el aviso sobre la optimización.