Threading Challenge 2010 Phase 2 - Winning Entries

Threading Challenge 2010 Phase 2 - Entries Submitted (Code and Write-up)

Below you will find the winning entries by problem for Phase 2 of the Threading Challenge 2010. Please feel free to review and join us in the forum dedicated to each problem to discuss.

Master Level

Problem 1 - Taxi Paths

Comment on the Taxi Path Dedicated Forum

First Place Winner: RuiDiao
Code | Write-up

Second Place Winner: mdma
Code | Write-up

Third Place Winner: akki
Code | Write-up

Problem 2 - Multi-list

Comment on the Multi-list Dedicated Forum

First Place Winner: DmitriyVjukov
Code | Write-up

Second Place Winner: akki
Code Part 1 | Code Part 2 | Write-up

Third Place Winner: gk4v07
Code | Write-up

Problem 3 - Cat and Mouse

Comment on the Cat and Mouse Dedicated Forum

First Place Winner: akki
Code | Write-up

Second Place Winner: DmitriyVjukov
Code | Write-up

Third Place Winner: RuiDiao
Code | Write-up

Problem 4 - Betweenness Metric

Comment on the Betweenness Metric Dedicated Forum

First Place Winner: DmitriyVjukov
Code | Write-up

Second Place Winner: RuiDiao
Code | Write-up

Third Place Winner: akki
Code | Write-up

Apprentice Level

Problem 1 - Bonev Sequences

Comment on the Bonev Sequences Dedicated Forum

First Place Winner: duncanhopkins
Code

Second Place Winner: andim
Code

Third Place Winner: xiangbo_x
Code

Problem 2 - Hailstone Numbers

Comment on the Hailstone Numbers Dedicated Forum

First Place Winner: duncanhopkins
Code

Second Place Winner: archie314
Code

Third Place Winner: RuiDiao
Code

Problem 3 - Reduced Deck Pai Gow Poker

Comment on the Reduced Deck Pai Gow Poker Dedicated Forum

First Place Winner: Vilya Harvey
Code

Second Place Winner: archie314
Code

Third Place Winner: changqingchen
Code

Problem 4 - Maximal Paths

Comment on the Maximal Paths Dedicated Forum

First Place Winner: changqinchen
Code Part 1 | Code Part 2

Second Place Winner: Vilya Harvey
Code

Third Place Winner: crockercaria
Code

Para obter mais informações sobre otimizações de compiladores, consulte Aviso sobre otimizações.