cdean16 09/07 - SRM 635, D1, 250 (SimilarRatingGraph) doneal5 09/07 - SRM 636, D1, 250 (ChocolateDividingEasy) nskuda 09/12 - SRM 713, D1, 500 (DFSCount) lmills9 09/14 - SRM 622, D1, 250 (BuildingRoutes) ztrzil 09/14 - SRM 638, D1, 300 (ShadowSculpture) kburova 09/19 - SRM 460, D2, 1000 (TheCitiesAndRoadsDivTwo) cdavid11 09/21 - SRM 623, D1, 300 (UniformBoard) daaser2 09/21 - SRM 628, D1, 250 (DivisorsPower) molson5 09/26 - SRM 652, D1, 500 (MaliciousPath) tsharpe1 10/03 - SRM 633, D1, 250 (PeriodicJumping) jzhao29 10/03 - SRM 678, D1, 500 (TheEmpireStrikesBack) grouleau 10/10 - SRM 648, D1, 500 (KitayutaMart) sbrow109 10/12 - SRM 632, D1, 250 (PotentialArithmeticSequence) dmusgrav 10/12 - SRM 667, D1, 250 (OrderOfOperations) mmacneil 10/17 - SRM 582, D1, 250 (SpaceWarDiv1) sbarton7 10/17 - SRM 665, D1, 300 (LuckySum) kye2 10/19 - TCO 2017 1A 1000 (PolygonRotation) ateepe 11/02 - SRM 566, D1, 250 (PenguinSledding) jwalk110 11/02 - SRM 666, D1, 222 (WalkOverATree) dlowe7 11/07 - SRM 681, D1, 250 (FleetFunding) avalesky 11/14 - SRM 637, D1, 500 (PathGame) gjones2 11/16 - SRM 630, D1, 250 (Egalitarianism3) swardick 11/16 - SRM 634, D1, 250 (ShoppingSurveyDiv1) ypei2 11/21 - SRM 650, D1, 500 (TheKingsRoadsDiv1) tdixon12 11/28 - SRM 485, D1, 250 (AfraidOfEven) mgoin 11/28 - SRM 624, D1, 250 (BuildingHeights) rriedel1 11/30 - TCO 015, Q1B 1000 (TheTreeAndMan) madams56 12/05 - SRM 649, D1, 550 (XorSequence)

- If you have problem that is D1 222, 250 or 300, then your presentation should be
between 5 and 10 minutes long. If you have a harder problem, then your presentation should
be between 7 and 15 minutes. You will be deducted if you go over or under.
- Assume that your audience has taken CS302. You don't need to explain Dijkstra's algorithm
or Dynamic Programming.
- You need a title slide with your name, affiliation, name of the problem, date. This slide should also be the last slide of your presentation.
- You need to state the problem, using examples and pictures, so that your audience has an
intuitive understanding of the problem.
- You need a slide with prototypes and variables (like mine).
- You need a slide with the constraints. This can be merged with the previous slide if everything fits cleanly. Otherwise, separate them.
- You need to present a solution. Try to make the solution intuitive, so that your audience understands it. Walk through examples. Sometimes it is helpful to present a solution that doesn't
work, but helps you to present the solution that does work.
- Sometimes, it's nice to present multiple solutions (like I did with the Christmas Tree
problem).
- You need to present the running time, where you describe the big-O performance of your solution(s).
- You need a performance slide where you detail performance on a machine, and show how the performance scales with input. If you have multiple implementations, compare them. You should specify the machine and its speed. This slide must have a graph, and the graph should be very clear. You
don't want to end up on the wall of shame.
- (Optional, but always interesting): Can you solve this in other, perhaps faster ways? Or can it be solved by other algorithms that we know about?
- How did the topcoders do? If fewer than 60% of them got it, it was a hard problem.

You can look up solutions as well on topcoder's web site. That's fine too. This is more about the presentation than the fact that you solved the problem.

You *cannot* lift graphics, either from my hints or from topcoder/wikipedia. Do your
own graphics and customize them for your talk.

If you want to talk things over, go to Aaron's office hours or schedule a time to talk with him.

Repeat after me: "Pictures are better than text." "Pictures are better than text." "Pictures are better than text."