12th Marathon of Parallel Programming

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

Problems Set

The problems were prepared and reviewed by the following judges:

• Calebe de Paula Bianchini (Mackenzie/BR)
• Emilio de Camargo Francesquini (Unicamp/BR)
• Leandro Augusto Justen Marzulo (UERJ/BR)
• Marcelo Panaro de Moraes Zamith (UFRRJ/BR)
• Stéfano Drimon Kurz Mór
• Tiago Assumpçáo de Oliveira Alves (UERJ/BR)
• Ubiratam Carvalho de Paula Junior (UFRRJ/BR)
• Wellington Santos Martins (UFG/BR)

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

• Problems
• 1. Transitive Closure (Wellington/Calebe) - source code
  2. Eternity II (Emilio) - source code
  3. Mandelbrot Set (Ubiratam/Marcelo) - source code
  4. K-Means Clustering (Leandro/Tiago) - source code
  5. Shortest Superstring (Stéfano) - source code

Organized by

Better seen in Mozilla Firefox.