6/20/2015 ProgrammingContestProblemTypes
http://train.usaco.org/usacotext2?a=HH8Ug0JaVuo&S=probs 1/1
ProgrammingContestProblemTypes
HalBurchconductedananalysisoverspringbreakof1999andmadeanamazingdiscovery:thereareonly16typesofprogrammingcontestproblems!Furthermore,thetopseveralcomprisealmost80%oftheproblemsseenattheIOI.Heretheyare:
DynamicProgrammingGreedyCompleteSearchFloodFillShortestPathRecursiveSearchTechniquesMinimumSpanningTreeKnapsackComputationalGeometryNetworkFlowEulerianPathTwoDimensionalConvexHullBigNumsHeuristicSearchApproximateSearchAdHocProblems
ThemostchallengingproblemsareCombinationProblemswhichinvolvealoop(combinations,subsets,etc.)aroundoneoftheabovealgorithmsorevenaloopofonealgorithmwithanotherinsideit.Theseseemextraordinarilytrickytogetright,eventhoughconceptuallytheyare``obvious''.
Ifyoucanmastersolvingjust40%oftheseproblemtypes,youcanalmostguaranteeasilvermedalattheIOI.Mastering80%movesyouintothegoldrangealmostforsure.Ofcourse,`mastery'isatoughnuttocrack!We'llbesupplyingaplethoraofproblemssothatyoucanhoneyourskillsinthequestforinternationalfame.
USACOGateway|CommentorQuestion
Top Related