March 12: Finishing Up -
No new problems this week, finish up problems you started before or
start on one you haven't done yet.
March 5: Sit-down-and-do-em problems
The Blocks
Problem - Might want to use some features of your STL containers
that you don't usually use.
(Solution)
Mutant
Flatworld Explorers - Do it once as written (easy) and then again
where there is a space between each of the instructions to the robot
(not too hard) (Solution)
Beggar my
Neighbor - A little STL hackery, a little long, and difficult to
debug. Definitely the hardest of these three.
(Solution)
Feb 19: STL Basics
Hartals
- Don't use arrays for this, use vector or set. This is an easy
problem (easier than we'll see in the SoCal contest.) (Solution)
Ananagrams
- Using set, map, and multiset, I know
this can be done in 30 lines of code. I find it really useful to
count letters in a word using a map of char to int. This is an easy
problem. (Solution)
Anagram
Checker - For this problem, you'll definitely want sets and you may want
maps. This is the
hardest problem. (Solution)