Matrix Exponentiation + Fibonacci in log(N)
Codeforces training contest: https://codeforces.com/gym/102644 This is a tutorial on matrix exponentiation, a tool that allows you to quickly find the n-th Fibonacci number or quickly compute the number of very long paths in a graph. After watching the video, try to solve the first 6 problems in the CF training contest. I will soon post another video (or make a live stream?) with solutions to those problems, and the last 3 hard problems. 0:00 Introduction & Prerequisites 1:13 A. Random Mood 6:17 B. String Mood 15:12 Implementation 19:38 General Recipe 23:17 C. Fibonacci 26:30 C++ Recipe 27:56 Random Again 28:27 Complexity & Summary 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: / errichto2 & / errichto FB and Twitter: / errichto & / errichto Frequently Asked Questions: https://github.com/Errichto/youtube/w... #Coding #Programming
Binary Exponentiation
Dynamic Programming lecture #1 - Fibonacci, iteration vs recursion
The Fibonacci Matrix
Matrix Exponentiation Coding (Part 1/2)
Computations Modulo P in Competitive Programming
Teaching Competitive Programming, Building a 300k Subscriber YT Channel | Kamil Debowski (Errichto)
One Formula That Demystifies 3D Graphics
When Math Isn’t Based in Reality
C++ Bitsets in Competitive Programming
Fibonacci slop is out of control
If Prime Numbers Become Increasingly Rare, Then Why Do They Keep Showing Up In Pairs?
Ones and Zeros Multiple (SPOJ / Polish Olympiad)
Solving the Fibonacci Sequence with Matrix Exponentiation
The Story of the WORLD’s NO. 1 PROGRAMMER | A must-watch for every Programmer
Co-Creator of Haskell: Useless vs Useful Languages, Rust vs C, Functional Programming | Simon Jones
The rarest move in chess
120x Faster Algorithm By Nested Loops
How (and why) to raise e to the power of a matrix | DE6
One second to find the BILLIONth PRIME
