ICPC Training Camp: Week 1 Insights | ZUMS Computer Society

Our competitive programming wing kicked off the semester with graph algorithms and dynamic programming problem sets. Here are the key takeaways.

The Programming Wing launched its ICPC Prep Training Camp — a 10-week structured program to prepare teams for the ACM-ICPC regional round. Week 1 focused on the foundations that make or break competitive programmers.

Week 1 Topics

Graph representation (adjacency list vs matrix) and BFS/DFS
Dynamic programming: top-down vs bottom-up memoization
Time complexity analysis and common traps

Problem Sets

Participants solved 15 curated problems on Codeforces ranging from 800 to 1600 difficulty rating. The average solve rate was 11/15 — an impressive start!

Week 2 will cover advanced graph algorithms including Dijkstra, Floyd-Warshall, and minimum spanning trees. Join the training sessions every Saturday at 10 AM in Room 302.