Computations Modulo P in Competitive Programming
Tutorial for beginners on computations modulo P in competitive programming. In so many Codeforces problems, we need to print the answer modulo M, most often M=10^9+7. What's the reason for that and how should it affect your code? Why modular subtraction is tricky and division even more difficult (modular inverse uses this https://en.wikipedia.org/wiki/Euler%27s_theorem)? Watch the video, then solve introductory problems here https://cses.fi/problemset/ and read Competitive Programmer's Handbook for some structured knowledge https://cses.fi/book/book.pdf
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
#Coding #Programming
Видео Computations Modulo P in Competitive Programming канала Errichto
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
#Coding #Programming
Видео Computations Modulo P in Competitive Programming канала Errichto
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
Binary ExponentiationGoogle Coding Interview With A Competitive ProgrammerHow To Become Red Coder? (codeforces.com)Interview with a Competitive ProgrammerPro vs. Hard Coding Interview Problem - LRU Cache (LeetCode Day 24)How to start Competitive Programming? For beginners!Leetcode problem Longest Palindromic Substring (two solutions)Facebook Coding Interview Question - First and Last Position of X in Sorted ArrayWhy Print answer modulo 10^9+7 | Modular Arithmetic | Competitive Programming Course | EP 11Acing Google Coding Interview as an 18 year old High School StudentA New Way to Look at Fibonacci NumbersWhat does a ≡ b (mod n) mean? Basic Modular Arithmetic, CongruenceThere is No Algorithm for Truth - with Tom ScottC++ Bitsets in Competitive ProgrammingBinary Search tutorial (C++ and Python)Dynamic Programming lecture #1 - Fibonacci, iteration vs recursionKickstart 2021 Round C (1st place)Modular exponentiationFacebook Hacker Cup 2020 R3 (I Got To Finals!)