------- 09/06 wck942 SRM 734 D1 300-Pointer TheRoundCityDiv1 09/06 zlu21 SRM 734, D1, 400-Pointer (CardCounter) 09/11 knicley2 TCO 2016 1A 500-pointer (EllysSocks) 09/13 jkovalcs SRM 610, D1, 250-pointer (TheMatrix) 09/13 zstrick4 SRM 633, D1, 250 (PeriodicJumping) 09/18 jruthe10 SRM 607, D1, 250-Pointer (PalindromicSubstringsDiv1) 09/18 mprice35 SRM 637, D1, 500 (PathGame) 09/20 ssmit285 TCO 015, Q1B 1000 (TheTreeAndMan) 09/25 barik SRM 628, D1, 250 (DivisorsPower) 09/25 crizzo SRM 629, D1, 500 (CandyCollection) 10/02 moneil8 SRM 566, D1, 250 (PenguinSledding) 10/09 anguye10 SRM 582, D1, 250 (SpaceWarDiv1) 10/09 jambros2 SRM 681, D1, 250 (FleetFunding) 10/11 fbetanco SRM 637, D1, 250-pointer (GreaterGame) 10/11 ngreen11 SRM 666, D1, 222 (WalkOverATree) 10/16 jwalk110 SRM 624, D1, 250 (BuildingHeights) 10/16 kveca1 SRM 691, D1 300 (SunnyGraphs) 10/18 jreesman SRM 721, D1, 250 (RememberWords) 10/18 smaclean SRM 634, D1, 250 (ShoppingSurveyDiv1) 10/23 jvomfell SRM 632, D1, 250 (PotentialArithmeticSequence) 10/23 akarnauc SRM 683, D1, 250-pointer (MoveStones) 10/30 dsande30 SRM 383 D1 500-Pointer (Floorboards) 10/30 ecritchl SRM 665, D1, 300 (LuckySum) 11/01 rflint SRM 713, D1, 500 (DFSCount) 11/01 slalani SRM 678, D1, 500 (TheEmpireStrikesBack) 11/06 jredingt SRM 635, D1, 250 (SimilarRatingGraph) 11/06 mshoffn2 SRM 667, D1, 250 (OrderOfOperations) 11/06 hgd145 SRM 623, D1, 300 (UniformBoard) 11/13 bkammerd SRM 652, D1, 500 (MaliciousPath) 11/13 tmn678 SRM 699, D1, 500-Pointer (FromToDivisible) 11/15 treid6 SRM 629, D1, 250-pointer (RectangleCovering) 11/15 iige SRM 649, D1, 550 (XorSequence) 11/20 bbeard1 SRM 460, D2, 1000 (TheCitiesAndRoadsDivTwo) 11/20 esmit121 SRM 622, D1, 250 (BuildingRoutes) 11/27 cmuncey SRM 608, D1, 250-pointer (MysticAndCandies) 11/27 mfoust5 SRM 636, D1, 250 (ChocolateDividingEasy) 11/29 cflemmon SRM 638, D1, 300 (ShadowSculpture) 11/29 kshahat SRM 648, D1, 500 (KitayutaMart) 12/04 bli43 TCO 2017 1A 1000 (PolygonRotation) 12/04 abahna SRM 630, D1, 250 (Egalitarianism3)

- 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 office hours or schedule a time to talk with the TA.

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