Advanced Algorithmic Problem Solving – AAPS/AAPS22

Assignments

• Exercise 1: Greedy Problems and Dynamic Programming I (Ended)
1. Help!
2. Ljutnja
3. Spiderman's Workout
4. Aspen Avenue
• Exercise 2: Data Structures (Ended)
1. Chopping Wood
2. Turbo
3. Introspective Caching
4. The SetStack Computer
• Exercise 3: Arithmetic (Ended)
1. Perfect Pth Powers
2. Three Digits
3. Ignore the Garbage
4. Dead Fraction
• Exercise 4: Greedy Problems and Dynamic Programming II (Ended)
1. Cudak
2. The Uxuhul Voting System
3. Whac-a-Mole
4. Funny Games
• Exercise 5: Graphs I (Ended)
1. Getting Gold
2. Frogger
3. Killing Aliens in a Borg Maze
4. Proving Equivalences
• Exercise 6: Graphs II (Ended)
1. Full Tank?
2. Island Hopping
3. George
4. Councilling
• Exercise 7: Graphs III (Ended)
1. Get Shorty
2. Hiding Places
3. XYZZY
4. Risk
• Exercise 8: Strings I (Ended)
1. Evil Straw Warts Live
2. Dictionary Attack
3. Dominant Strings
4. Intellectual Property
• Exercise 9: Strings II (Ended)
1. Suffix Array Re-construction
2. Code Theft
3. Messages from Outer Space
4. Life Forms
• Exercise 10: Number Theory (Ended)
1. Factovisors
2. Happy Happy Prime Prime
3. Circular Lock
4. Rasterized Lines
• Exercise 11: Search (Ended)
1. Yet Satisfiability Again!
2. Gokigen Naname
3. Square Fields (Hard)
4. Maximum Loot
• Exercise 12: Computational Geometry (Ended)
1. Board Wrapping
2. Triangle Trilemma
3. White Water Rafting
4. Barking Up The Wrong Tree
• Exercise 13: Mixed (Ended)
1. How many 0's?
2. (un)Fair Play
3. Bag of Tiles
4. Towers of Powers 2: Power Harder
• Lab 0: Optional Practice Problems (Ended)
1. Quick Estimates
2. Counting Stars
3. Hay Points
4. Odd Man Out
5. I Can Guess the Data Structure!
6. Perket
7. Curse the Darkness
8. Sierpiński Circumference
• Lab 1 (Ended)
1. Interval Cover
2. Knapsack
3. Longest Increasing Subsequence
4. Union-Find
5. Fenwick Tree
6. Polynomial Multiplication 2
7. Linear Equation Solver
8. Partial Linear Equation Solver
• Lab 2 (Ended)
1. Single source shortest path, non-negative weights
2. Single source shortest path, time table
3. Single source shortest path, negative weights
4. All Pairs Shortest Path
5. Minimum Spanning Tree
6. Maximum Flow
7. Minimum Cut
8. Minimum Cost Maximum Flow
9. Eulerian Path
• Lab 3 (Ended)
1. String Matching
2. Suffix Sorting
3. Dvaput
4. Rational Arithmetic
5. Modular Arithmetic
6. Chinese Remainder
7. Chinese Remainder Theorem (non-relatively prime moduli)
8. Prime Sieve
• Lab 4 (Ended)
1. Polygon Area
2. Point in Polygon
3. Line Segment Intersection
4. Line Segment Distance
5. Closest Pair (Uniform)
6. Closest Pair
7. Convex Hull
8. Maximum Number of Colinear Points
9. Linear Recurrences
• Problem Solving Session: Practice (Ended)
1. Babelfish
2. CD
3. Closest Sums
4. Mathemagicians
• Problem Solving Session: Individual I (Ended)
1. Bank Queue
2. Classrooms
3. Ladice
4. Moogle
5. Movie Collection
6. Walrus Weights
• Problem Solving Session: Individual II (Ended)
1. Arbitrage?
2. Arctic Network
3. Antenna Placement
4. Gopher II
5. Trapezoid Walkway
6. Where's My Internet??
• Problem Solving Session: Group I (Ended)
1. Bond
2. Distinctive Character
3. Disastrous Downtime
4. Excavator Expedition
5. Train Sorting
6. Treehouses
• Problem Solving Session: Individual III (Ended)
1. Automatic Trading
2. Candy Distribution
3. Fundamental Neighbors
4. Genetic Search
5. Phone List
6. Pseudoprime numbers
• Problem Solving Session: Individual IV (Ended)
1. Dart Scoring
2. Keeping the Dogs Apart
3. Imperfect GPS
4. Pop!
5. Sumdoku
6. Trojke
• Problem Solving Session: Group II (Ended)
1. Birthday Cake
2. Boggle
3. Palindrome Substring
4. Platforme
5. Relatives
6. Return of the Jedi

Teachers