let's start Code

11503 - Virtual Friends

11503 - Virtual Friends Topic: DSU solution 01: //copy 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 #include <bits/stdc++.h> using namespace...
Share:

10685 - Nature

10685 - Nature Topic: ডিসজয়েন্ট সেট Solution 01: //copy 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 #include <bits/stdc++.h> using...
Share:

459 - Graph Connectivity

459 - Graph Connectivity Topic: Union Find Algorithm ডাটা স্ট্রাকচার: ডিসজয়েন্ট সেট(ইউনিয়ন ফাইন্ড) Solution 01: //copy 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 #include...
Share:

B. F1 Champions

B. F1 Champions operatopr overloading conecpt  Solution 01: help from rng_58 //copy 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 #include<bits/stdc++.h> using...
Share:

Fenwick (Binary Indexed) Trees

Fenwick প্রোগ্রামিং প্রবলেম (Programming Problem in Bengali)(Binary Indexed) Trees Fenwick Tree  Where's the tree in Fenwick tree?  visualgo kartikkukreja  ডাটা স্ট্রাকচার: বাইনারি ইনডেক্সড ট্রি Topcoder Algorithm  Zobayer blog ( see also Felix halim comment)  CF blog  Youtube Video: Algorithms live  Bangla...
Share:

216 - Getting in Line

216 - Getting in Line Topic: Travelling Salesman Problem Solution 01: Github gist 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 ...
Share:

Travelling Salesman Problem

Travelling Salesman Problem CODING BLOCKS Geeks for Geeks Using Branch and Bound visualgo-tsp  Implementation 01: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 #include<bits/stdc++.h> using namespace std; int dp[1<<20][20]; int...
Share:

About

let's start CODE

Popular Posts