Computer Programming Contest Preparation

Fall 2003 -- Contest Practice

[Isaac's Home Page ]  [Fun Page ]  [Class Page ]  [Printable ]  
   Home
   Vote
   Voted
   GetInfo
   Teams
   Approach
   Stuff
   References
 
 Library:
   Large Number
 
 Problems:
   Archive
   Solved
   Categories
 
 Pair Matrix:
   Table
   Ascii
 
 Team Matrix:
   Table
   Ascii
 

Things to Master to be Successful when Competing in a Contest

  • Pre-Contest Preparation
    • Problem Solution Library
    • Utility Library Development
  • Data Structures + Algorithms
    • Classic Problem/Solution Categories
      • Basic Tools
        • Sorting/Searching (use built-in Quicksort)
      • Graph
        • Spanning Tree, Kruskal and Prim
        • Djikstra's
        • Floyd
      • Math
        • Least Common Multiple/Greatest Common Denominator
        • Modular/Modulo/Clock Arithmetic
        • Primes/Factorization
        • Geometry
          • Line Segments
          • Intersection of Line Segments
          • Distance
          • Points contained in a polygon
          • Intersections of polygons/lines
        • Large Number
      • String
        • String Matching
        • String Searching
  • Management
  • Contest Concepts
  • Future


Return to Top of Page


Return to Top of Page





[ Powered by Red Hat Linux ] [ Powered by Apache ] [ Powered by PHP ]

The statements and opinions included in these pages are those of only. Any statements and opinions included in these pages are not those of Louisiana State University or the LSU Board of Supervisors.
© 1999, 2000, 2001, 2002, 2003 Isaac Traxler