9th Marathon of Parallel Programming

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

Problems Set

The problems were prepared and reviewed by the following judges:

• Calebe de Paula Bianchini (Mackenzie/BR)
• Daniel de Angelis Cordeiro (IME/USP)
• Emilio de Camargo Francesquini (Unicamp/BR)
• Leandro Augusto Justen Marzulo (UERJ/BR)
• Raphael Y. de Camargo (UFABC/BR)
• Stéfano Drimon Kurz Mór (UFRGS/BR)

• Warmup (some inputs)
• 1. Harmonic progression sum (2006) - sequential

• Problems (some inputs)
• 1. The Energy Minimization Cooking Problem (Daniel) - sequential
  2. The Traveling-Salesman Problem (Emilio) - sequential
  3. Minimum Weight Polygon Decomposition (Leandro) - sequential
  4. A Graph's Maximal Independent Set (Stéfano) - sequential
  5. Enumeration Sort (Calebe) - sequential
  6. Dijkstra (Raphael) - sequential

Organized by

Better seen in Mozilla Firefox.