10th Marathon of Parallel Programming

• 
• Home
• Rules
• Computational Environment
• Registration
• Winners
• Problems set
• Local Committee
•  
• How to study
• Committee
• Old contests
• Contact
•  
• Visitor number

Problems Set

The problems were prepared and reviewed by the following judges:

• Calebe de Paula Bianchini (Mackenzie/BR)
• Denise Stringhini (UNIFESP/BR)
• Emilio de Camargo Francesquini (Unicamp/BR)
• Leandro Augusto Justen Marzulo (UERJ/BR)
• Stéfano Drimon Kurz Mór (UFRGS/BR)

• Warmup
• 1. Harmonic progression sum (from 2006) - source code

• Problems
• 1. Lossless Text Compression (Stéfano) - source code
  2. N-Body (Leandro) - source code
  3. LU Decomposition (Calebe) - source code
  4. The K-Means Clustering Problem (Emilio) - source code
  5. Raytracer (Calebe) - source code
  6. Karatsuba Multiplication (Calebe) - source code
  7. Bitonic Sort (Denise/Calebe) - source code

Organized by

Better seen in Mozilla Firefox.