Matrix Exponentiation + Fibonacci in log(N)
67.7 هزار بار بازدید -
4 سال پیش
-
Codeforces training contest:
Codeforces training contest: 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: github.com/Errichto/youtube
- Live streams on 2nd YT channel and on Twitch: youtube.com/errichto2 & www.twitch.tv/errichto
- FB and Twitter: www.facebook.com/errichto & twitter.com/errichto
- Frequently Asked Questions: github.com/Errichto/youtube/wiki/FAQ
#Coding #Programming
4 سال پیش
در تاریخ 1399/04/26 منتشر شده
است.
67,716
بـار بازدید شده