The objective of this course is to learn how to solve a problem given by a textual description. This includes appropriate problem modeling, choice of suitable (combinatorial) algorithms, and implementing them. This repository includes all exercises descriptions of this course and gives corresponding C++ solutions.
These exercises are in ACM style and mainly use the following libraries: STL, BGL and CGAL. The main algorithms and thoughts include Sliding Window, Sorting, Binary Search, Depth/Breadth First Search, Greedy, Backtracking, Disjoint Set, Dynamic Programming, Minimum Circle, Connected Component, Minimum Spanning Tree, Shortest Path, Maximum Matching, Split and List, Linear/Quadratic Programming, Delaunay Triangulation and Maximum Flow with/without Minimum Cost.
Week 1: Build the Sum, Even Pairs, Dominoes, Even Matrices, False Coin, Deck of Cards.
Week 2: Search Snippets, Boats, Moving Books, Evolution, Octopussy.
Week 3: Hit, First Hit, Hiking Maps, Antenna, Attack of the Clones.
Week 4: First Steps with BGL, Ant Challenge, Important Bridge, Buddy Selection, TheeV.
Week 5: Burning Coins from Two Sides, Light Pattern, Light at the Museum, The Great Game, Poker Chips, On Her Majesty’s Secret Service.
Week 6: Coin Tossing Tournament, Shopping Trip, Kingdom Defence, A New Hope.
Week 7: Maximize It, Diet, Portfolios, Inball, Knights.
Week 8: Graypes, Bistro, H1N1, Germs, Stamp Exhibition.
Week 9: Real Estate Market, Satellite, Algocoön Group, Canteen, Casino Royale.
Week 10: Odd Route, Light the Stage, Bonus Level, Revenge of the Sith.
Week 11: Clues, Punch, Carsharing, Planks.
Week 12: New Tiles, Golden Eye, Corbusier's Modulor, Placing Knights, Radiation Therapy, The Empire Strikes Back.
Week 13: Bob's Burden, DHL, Sweepers, Portfolios Revisited, The Phantom Menace.
Week 14: Cantonal Courier.