Resource:
আমার নীল খাতার প্রথম পেজ এ (এক পেজ)।
Practice:
Template:
Resource:
Practice:
Resource:
Practice:
Template:
Resouce:
https://www.youtube.com/watch?v=VwRZbQ6dycA&list=PLWtSipmftM8q_CPhQ2lLeiG81advwlk6g&index=10
আমার নীল খাতা ।
Practice:
Resource:
https://www.geeksforgeeks.org/hopcroft-karp-algorithm-for-maximum-matching-set-1-introduction/
আমার নীল খাতা ।
https://www.youtube.com/watch?v=0ZTgyUlCyOw&list=PLv0QPiaV6CZsqdsKEjGUN5P74a5rDKX15&index=40
6.(Edmond's Blossom For All Bipartite+non_bipartite Graph) https://www.youtube.com/watch?v=skdXpRtklwQ&list=PLv0QPiaV6CZsUiM0fa0WDLOUiio9jxvfB&index=27
Practice:
Template:
Resource:
আমার নীল খাতা ।
Practice:
Template:
Resource:
(Euclidean Algorithm): https://forthright48.com/euclidean-algorithm
(Extended Euclidean Algorithm): https://forthright48.com/extended-euclidean-algorithm/
(Chinese Remainder Theorem): https://forthright48.com/chinese-remainder-theorem-part-1-coprime-moduli/
আমার নীল খাতা ।
Practice:
Template:
(Extended Euclide And Modular Inverse): https://github.com/Shefin-CSE16/Competitive-Programming/blob/master/Templates/Extended%20Euclid%20%26%20Modular%20Inverse.cpp
(Chinese Remainder Theorem): https://github.com/Shefin-CSE16/Competitive-Programming/blob/master/Templates/Chinese%20Remainder%20Theorem%20(CRT).cpp
Resource:
আমার নীল খাতা ।
Practice:
Template:
Resource:
Practice:
Resource: 1. https://www.youtube.com/watch?v=EE6bOcDbEPE
Resource:
Note: ***(Every labeled tree of N nodes can be uniquely represented as an array of N−2 integers and vice versa). ***(Number of unique tree constructed by N vertex= N^(N-2) According to prufer code).
Resource And Template:
Practice:
To generate random Tree: 1. use template of prufer code. 2.
n=vertex_number;
cout<<n<<'\n';
vector <int> pruf(n-2);
for(auto &x : pruf) x = gen_random(1, n);
vector<pair<int,int>> edge = pruferCodeToTree(pruf);
for(auto &e : edge) cout << e.uu << " " << e.vv << '\n';mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
inline ll gen_random(ll l, ll r) {
return uniform_int_distribution<ll>(l, r)(rng);
}
// call for get a random number (from l to r range): gen_random(l,r);for((i = 1; ; ++i)); do
echo $i
./gen.exe $i > gem.txt
diff -w <(./Untitled4.exe < gem.txt) <(./brute.exe < gem.txt) || break
donehttps://drive.google.com/file/d/1623Hu3XaAzqq-aApbDGgi0hFiU27bMMT/view?usp=sharing
Resource:
আমার নীল খাতা ।
Practice:
Note: any doubt about HLD template just contact with shefin vai...
problem: https://mirror.codeforces.com/contest/1849/submission/216141125 complexity-calculation: https://ibb.co/Tt7XtVj
problem-2: https://mirror.codeforces.com/contest/1156/problem/E
