During the course, you’ll learn everything needed to participate in real competitions — that’s the main goal. Along the way you’ll also gain useful skills for which competitive programmers are so highly valued by employers: ability to write efficient, reliable, and compact code, manage your time well when it’s limited, apply basic algorithmic ideas to real problems, etc.
课程信息
讲师
提供方

圣彼得堡国立大学
Санкт-Петербургский государственный университет (СПбГУ) — старейший вуз России, основанный в 1724 году. Университет сегодня — научный, образовательный и культурный центр мирового значения, неизменно входящий во все международные рейтинги вузов. В номинации взаимодействие с работодателями QS Graduate Employability 2018 СПбГУ занимает 20 место среди 400 ведущих вузов мира и является лучшим в России.
教学大纲 - 您将从这门课程中学到什么
Programming Competitions
We'll begin with introduction to the world of competitive programming — the rules, specialties and helpful tips on taking part in competitions in general. In a separate lesson, we'll learn how to test programs: what kinds of test cases there are, how to organize the search for a bugtest, and particularly a method of automating testing called stress-testing.
CORRECTNESS FIRST
In this module, we'll start with the most basic things you need to actually solve algorithmic problems. First, we'll talk about structuring your code and intuition behind it — why it's very important, how to manage dependencies between parts of different purpose, how intuitive rules are enforced through formal invariants and conditions. We'll also identify a special class of solutions — brute force solutions — which are always correct, but often very slow. And we'll learn how to estimate running time of our solutions by using a powerful concept of big-O notation.
COMMON STRUGGLES
In competitive programming, there are a lot of things to stumble upon — if you don't know them first! We'll delve into how numbers are represented in computers, identify the most common issues with integer and floating point arithmetic, and learn to overcome them. We'll also discuss how to get stuck less in general, especially when debugging solutions.
COMMON STRUGGLES 2
We continue considering common struggles arising in competitive programming. We start by learning how to prove that a natural greedy algorithm is correct. We also discuss programming languages: what features are most helpful on competitions, and what are the advantages and pitfalls of several frequently used languages. Finally, we study an essential and easy-to-implement data structure: the segment tree.
审阅
来自COMPETITIVE PROGRAMMER'S CORE SKILLS的热门评论
Very helpful course full of valuable information It's just exactly what you need in competitive programming\n\nBut the accent is kind of strange hopefully you can get used to it
The Course covers all basic topics that are essential for partiticipating in competitions. The discussion forum is very useful and the instructors give prompt replies.
A very informative and detailed course on competitive programming . A perfect course for a beginner to begin with . Grateful to tutors and the material they presented.
One of the best course on coding and competitive programming !! 👏👏 Please add lecture slides of each week to download
常见问题
我什么时候能够访问课程视频和作业?
我购买证书后会得到什么?
Is financial aid available?
还有其他问题吗?请访问 学生帮助中心。