Algorithms Live! with Errichto

Revision en3, by tehqin, 2018-12-22 01:54:33

This week's episode will feature Errichto and will take place on Sunday, December 16th. If you are interested in viewing the live stream, you can find the link here or view the video after the stream following the same link.

Many of you know Errichto as a prolific problem writer and his recent appearances in TCO, Google Code Jam, Facebook Hacker Cup, and many other programming contest finals. He represented the University of Warsaw in the 2018 ACM ICPC World Finals, where his team placed 14th. This year he started an educational stream for competitive programming that is growing in popularity.

In this episode, we will discuss the benefits of educational streaming in competitive programming and ideas for making competitive programming more popular. Topics will include: how programming contests relate to e-sports, broadcasts for programming competition finals and how they can be improved, and algorithms videos on YouTube and what we would like to see in the future for popularizing the sport. I think this will be a fun podcast style stream. Please ask questions on this post for ideas that you would like to see discussed.

As with all Algorithms Live! episodes, we will be discussing an interesting algorithmic programming challenge. In this episode, we will discuss Errichto's problem 1025F - Disjoint Triangles. As build up to this problem, we will also be discussing Interstellar Battle from Bubble Cup earlier this year. This is sure to be an exciting episode with many interesting topics and ideas.

See you live!

Update: We moved the stream to next Saturday at the same time. This way we do not conflict with today's Codeforces round.

Update 2: A friendly reminder that this episode will be streamed live in 15 hours.

Tags algorithms live

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English tehqin 2018-12-22 01:54:33 90
en2 English tehqin 2018-12-16 16:26:23 129
en1 English tehqin 2018-12-14 20:57:49 1713 Initial revision (published)