TopThis is an independent work module to train for the ACM ICPC regional in Singapore on December 14.
It covers techniques for attacking and solving challenging computational
problems. Fundamental algorithmic solving techniques covered include
divide and conquer, greedy, dynamic programming, backtracking and
branch and bound. Domain specific techniques like number theory,
computational geometry, string processing and graph theoretic will also
be covered. The module also covers
algorithmic and programming language toolkits used in problem solving
supported by the solution of representative or well-known problems in the
various algorithmic paradigms.
To see if this module is suitable for you, explore around the
Spanish Judge site
and try out some of the easier problems there.