Chinese Remainder Theorem, 2-minute Method

A simple method for Chinese Remainder Theorem (solving system of congruences), without any modular inverse. Here's my code for Advent of Code day 13 https://github.com/Errichto/youtube/blob/master/AOC-2020/13-search/shuttle2.cpp 0:00 Example 1 2:02 In General 2:56 LCM 4:05 Big Example 7:31 Extra Understanding Subscribe for more educational videos on algorithms, coding interviews and competitive programming. - Github repository: https://github.com/Errichto/youtube - Live streams on 2nd YT channel and on Twitch: https://www.youtube.com/errichto2 & https://www.twitch.tv/errichto - FB and Twitter: https://www.facebook.com/errichto & https://twitter.com/errichto - Frequently Asked Questions: https://github.com/Errichto/youtube/wiki/FAQ