Program description

Could you call yourself a programming guru? How many programming languages do you know? What is the difference between high-level and low-level programming languages? The world-class experts will help you gain knowledge, obtain professional skills, and acquire unique international experience in the field.

Learn from the world's 7-times programming champions to achieve excellent career expertise!

Who can apply?

• Students with programming language skills (Python / C++/ Java) 
• Students proficient in English language (B1 and higher)

What will you get?

• ITMO’s official certificate, 3 ECTS
• Experience in solving programming contests tasks 
• Theoretical knowledge on advanced topics of computer science
• Additional points when applying for ITMO’s Master’s programs

Why choose ITMO?

• Entered the top 100 (#74) in Computer Science by QS World University Rankings
• ITMO team is the world's only 7-times ACM ICPC champion 
• 365th in QS World University Rankings
• Ranked 6th among Russian universities by Forbes University Ranking
• 170+ partner universities around the world

Camp Schedule

Students can choose a group depending on their time preferences. 
Morning classes are held from 11:00 to 15:00, evening classes – from 17:00 to 21:00 (GMT +3).

• January 10, Monday – Sorting and Binary Search
• January 11, Tuesday – Dynamic Programming
• January 12, Wednesday – Graphs, Depth First Search, Connected Components and Strongly Connected Components
• January 13, Thursday – Graphs, Shortest Paths, BFS, Dijkstra Algorithms
• January 14, Friday – Strings, Prefix-function, Z-function, Hashing
• January 17, Monday – Segment Tree
• January 18, Tuesday – RMQ, LCA, Sparse Table
• January 19, Wednesday – One topic will be chosen in accordance with students’ preferences and skills: Geometry, Dynamic Programming 2, or Minimum Spanning 
• January 20, Thursday – One topic will be chosen in accordance with students’ preferences and skills: Game Theory, Grundy Theorem, Retroactive Analysis of Cyclic Graphs, Fast Fourier Transform, or Suffix Array
• January 21, Friday – One topic will be chosen in accordance with students’ preferences and skills: Last day contest, Maximum Flow Problem, or NP-completeness and Backtracking