• Evaluation Formula
• Weekly Problems
  • #01 - Introduction to the course & first problems
  • #02 - Sublinear complexity data structures (map, set, priority_queue)
  • #03 - Sorting, binary search, ternary search, bisection
  • (more to be added)
• Competitive Events
  
  • 1st Contest: 20 Oct [in class, individual, ICPC style]
  • 2nd Contest: 15 Dec [in class, individual, partial scoring]
  • 3rd Contest: Jan ? (format to be defined)

• Submissions on weekly problems | ("evaluation" version)
• Submissions Ranking
• List of all submissions
• Usernames on Codeforces

• [15/09] #01 - Introduction to the course & first problems
• [22/09] #02 - Sublinear complexity data structures (map, set, priority_queue)
• [29/09] #03 - Sorting, binary search, ternary search, bisection
• [06/10] #04 - Sqrt decomposition, segment trees and variants
• [13/10] #05 - Cumulative sums and fenwick trees (BITs)
• [20/10] 1st OnSite Contest
• [27/10] No Classes (FCUP Activities Week)
• [03/11] #06 - Dynamic Programming I (classic)
• [10/11] #07 - Dynamic Programming II (partitions, games, dags, counting, search)
• [15/11] #08 - Graphs I (DFS, BFS, topological sorting, articulation points, bridges, euler paths, ssc)
• [24/11] #09 - Graphs II (distances: Dijkstra, Bellman-Ford, Floyd; MST: Prim+Kruskall; max flow)
• [01/12] No Classes (national holiday)
• [08/12] No Classes (national holiday)
• [14/12] #10 - Strings (KMP, Aho-Corasick, tries, suffix trees, suffix arrays)
• [15/12] 2nd OnSite Contest
• [extra] #11 - Computational Geometry (points, lines, polygons, intersections, areas, inclusion, convex hull) (optional, not counting towards grade)

• Main online judges that will be used on this course:
  • [Mooshak] Mooshak (our local judge hosted at DCC)
  • [CF] CodeForces
• Other online judges: QOJ | AtCoder | CSES | SPOJ | Kattis | PEG | Timus | DM:OJ | UVA (uHunt) (uDebug)
• Other online contests/communities: CodeChef | HackerRank | Topcoder | Project Euler

• Awesome Competitive Programming (A curated list of awesome Competitive Programming, Algorithm and Data Structure resources)
   
• USACO Guide | resources (A free collection of curated, high-quality resources to take you from Bronze to Platinum and beyond.)
   
• Main recommended books (available for free):
  • Competitive Programming | PDF 2nd Edition (free)
  • Competitive Programmer's Handbook | PDF (free)
• Other books:
  • Introduction to Algorithms
  • Algorithm Design Manual
• Algorithmic Tutorials:
  • TopCoder: Competitive Programming Tutorials
  • MAXimal: E-Maxx Algorithms in English
  • PEG: PEG Wiki
  • Geek for Geeks: Fundamentals of Algorithms | How to prepare for ACM-ICPC?
  • CodeForces: Good Blog Post Resources about Algorithm and Data Structures
  • Codechef: Data Structures and Algorithms
• Implementations/Notebooks (you are strongly advised to implement by yourselves before seeing how others did)
  • CodeLibrary (Java and C++) | Github
  • Stanford Notebook (C++) | Github
  • KTH Notebook (C++) | Github
  • spaghetti-source (C++)

• 15-295: Competition Programming and Problem Solving (CMU, USA)
• CS104c: Competitive Programming (UTAustin, USA)
• CS3233 - Competitive Programming (NUS, Singapura)
• CS 97SI: Introduction to Programming Contests (Stanford, USA)
• T-414-ÁFLV: A Competitive Programming Course (Reykjavik University, Iceland)

Pedro Ribeiro - DCC/FCUP | Last update: