Competitive Programming 3 – CS490-CP3/Spring2020

Assignments

• W5:Number Theory (Ended)
1. Divisible Subsequences
2. Enlarging Hash Tables
3. Non-Prime Factors
• W6:Bitmask DP (Ended)
1. Bus Planning
2. Hiding Chickens
• W1:Binary Indexed Tree (Ended)
1. Fenwick Tree
2. Association of Cats and Magical Lights
3. Movie Collection
• W2:DFS Tree (Ended)
1. Cave Exploration
2. Intercept
3. Keeping On Track
• W4:SQRT (Ended)
1. Covered Walkway
2. Modulo Data Structures
3. Reconnaissance
• Graph Connectivity (Ended)
1. Cantina of Babel
2. Dominos
3. Proving Equivalences
• Network Flow (Ended)
1. RA Duty Scheduler
2. Jupiter Orbiter
3. Maximum Flow
4. Minimum Cut
5. Transportation Delegation
6. Waif Until Dark
• String (Ended)
1. Burrows-Wheeler
2. Buzzwords
3. Dvaput
4. String Matching
5. String Multimatching
6. Suffix Sorting

Teachers