// The base template c++ code
#include <bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
#define ar array
#define ll long long
#define ld long double
#define sza(x) ((int)x.size())
#define all(a) (a).begin(), (a).end()
const int MAX_N = 1e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;
void solve() {
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int tc = 1;
// cin >> tc;
for (int t = 1; t <= tc; t++) {
// cout << "Case #" << t << ": ";
solve();
}
// Close files
fclose(stdin);
fclose(stdout);
}
#include <bits/stdc++.h>
using namespace std;
// ------ The code from leetcode ----
// ------ ------------------------ ----
int main()
{
Solution sol;
return -1;
}
To find duplicates present in a vector,
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
template<typename T>
std::set<T> findDuplicates(std::vector<T> vec) // no-ref, no-const
{
std::set<int> duplicates;
std::sort(vec.begin(), vec.end());
std::set<int> distinct(vec.begin(), vec.end());
std::set_difference(vec.begin(), vec.end(), distinct.begin(), distinct.end(),
std::inserter(duplicates, duplicates.end()));
return duplicates;
}
int main()
{
std::vector<int> vec = {2, 2, 4, 1, 3, 6, 6, 7, 6, 8};
std::set<int> duplicates = findDuplicates(vec);
for (auto &i: duplicates) {
std::cout << i << ' ';
}
return 0;
}
- Kruskal's algorithm✅
- Prim jarniks algorithm✅
- Baruvka's algorithm
- pick/skip
- DFS (for matrix problems)
- Matrix Chain Multiplication
- Left & Right DP
- Hit lottery (CF)
- Fair division (CF)