Learn the main ideas that form the backbone of contest problem solving. This course covers dynamic programming, number theory, graph traversals, shortest paths, geometry, scanline, basic game theory, and more advanced forms of binary search.
Skanerlash chizig'i (scanline)
Skanerlash usuli
Mashq uchun masalalar
Introduction to DP
Dinamik dasturlash
$O(\sqrt{n})$ tezlikda sonni tublikka tekshirish, Eratosfen g'alviri, $O(\sqrt{n})$ da faktorizatsiya
Ushbu bo‘limda biz sonning tub ekanligini tekshirishni, $\sqrt{N}$ gacha sonning barcha bo‘luvchilarini qanday topish mumkinligini va sonni tub ko‘paytuvchilarga ajratishni o‘rganamiz
Eratosten elagi haqida bilib oling
DFS, BFS, Komponentlarni ko‘rish, Grafni 2 rangga bo‘yash, Siklni aniqlash (yo‘naltirilgan va yo‘naltirilmagan), Topologik saralash
Chuqurlik bo‘yicha qidiruv (DFS)ni o‘rganing
Kenglik bo‘yicha qidiruv (BFS) haqida bilib oling
Bipartitelikka tekshirish
Bog‘langan komponentlarni topish
Topologik saralash
Deykstra algoritmi, Bellman-Ford, Floyd Warshall
Dijkstra algoritmi haqida bilib oling
Floyd–Warshall algoritmini o‘rganing
Bellman–Ford algorithm
O'yinlar nazariyasi - Asoslar
O‘yin holatlarining asoslarini o‘rganing
Geometriyaga kirish
Uchburchakning ishorali yuzi
Basic Geometry
Harder geometry problems
Javob bo‘yicha ikkilik qidiruv, suzuvchi nuqtali (double) sonlarda ikkilik qidiruv, uchlik qidiruv, ikki sonining darajalari bo'yicha ikkilik qidiruv
Javob bo‘yicha binar qidiruv
Haqiqiy sonlar bo‘yicha ikkilik qidiruv
Uchlik qidiruv
Ikki sonining darajalari bo'yicha binar qidiruv