Scribd
Upload
113 views1 page

Programming Contest Problem Types

There are only 16 types of programming contest problems according to an analysis in 1999. The top types comprise almost 80% of problems seen at international competitions. These include dynamic programming, greedy algorithms, complete search, shortest paths, and more. The most challenging problems involve combinations of algorithms in loops. Mastering 40% of the problem types can earn a silver medal, and mastering 80% puts one in the gold range. Practice is needed to truly master the techniques.

Uploaded by

kabhijit04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
113 views1 page

Programming Contest Problem Types

There are only 16 types of programming contest problems according to an analysis in 1999. The top types comprise almost 80% of problems seen at international competitions. These include dynamic programming, greedy algorithms, complete search, shortest paths, and more. The most challenging problems involve combinations of algorithms in loops. Mastering 40% of the problem types can earn a silver medal, and mastering 80% puts one in the gold range. Practice is needed to truly master the techniques.

Uploaded by

kabhijit04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

6/20/2015

ProgrammingContestProblemTypes

ProgrammingContestProblemTypes

HalBurchconductedananalysisoverspringbreakof1999andmadeanamazing
discovery:thereareonly16typesofprogrammingcontestproblems!Furthermore,the
topseveralcomprisealmost80%oftheproblemsseenattheIOI.Heretheyare:
DynamicProgramming
Greedy
CompleteSearch
FloodFill
ShortestPath
RecursiveSearchTechniques
MinimumSpanningTree
Knapsack
ComputationalGeometry
NetworkFlow
EulerianPath
TwoDimensionalConvexHull
BigNums
HeuristicSearch
ApproximateSearch
AdHocProblems
ThemostchallengingproblemsareCombinationProblemswhichinvolvealoop
(combinations,subsets,etc.)aroundoneoftheabovealgorithmsorevenaloopofone
algorithmwithanotherinsideit.Theseseemextraordinarilytrickytogetright,even
thoughconceptuallytheyare``obvious''.
Ifyoucanmastersolvingjust40%oftheseproblemtypes,youcanalmostguaranteea
silvermedalattheIOI.Mastering80%movesyouintothegoldrangealmostforsure.
Ofcourse,`mastery'isatoughnuttocrack!We'llbesupplyingaplethoraofproblems
sothatyoucanhoneyourskillsinthequestforinternationalfame.

USACOGateway|CommentorQuestion

http://train.usaco.org/usacotext2?a=HH8Ug0JaVuo&S=probs

1/1

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy