Instantly share code, notes, and snippets.

View mirror.cpp
#include <bits/stdc++.h>
const int MAXN = 100005;
using namespace std;
using lint = long long;
typedef pair<lint, lint> pi;
typedef long long lint;
struct seg{
int x, l, r, num;
};
View mirror.cpp
#include <bits/stdc++.h>
const int MAXN = 100005;
using namespace std;
using lint = long long;
typedef pair<lint, lint> pi;
typedef long long lint;
struct seg{
int x, l, r, num;
};
View mirror.cpp
#include <bits/stdc++.h>
const int MAXN = 100005;
using namespace std;
using lint = long long;
typedef pair<lint, lint> pi;
typedef long long lint;
struct seg{
int x, l, r, num;
};
View euler_tour.cpp
#include <cstdio>
#include <vector>
using namespace std;
vector<int> v;
int n,adj[1005][1005];
void f(int x){
for (int i=1; i<=n; i++) {
if(adj[x][i]){
View greedy.cpp
int dfs(int x, int p){
vector<int> e;
for(auto &i : tr[x]){
if(i == p) continue;
e.push_back(dfs(i, x));
}
if(e.empty()) return 1;
sort(e.begin(), e.end());
for(int i=0; i<e.size()-1; i++){
v.push_back(e[i]);
View ahocorasick.cpp
const int MAXN = 100005, MAXC = 26;
struct aho_corasick{
int trie[MAXN][MAXC], piv; // trie
int fail[MAXN]; // failure link
int term[MAXN]; // output check
void init(vector<string> &v){
memset(trie, 0, sizeof(trie));
memset(fail, 0, sizeof(fail));
memset(term, 0, sizeof(term));
View fb17r3a.cpp
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pi;
const int mod = 1e9 + 7;
int rev[1005], sfx[1005];
char str[1005];
int n;
View b.cpp
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pi;
int cnt[10005], n;
int main(){
cin >> n;
int sum = 0;
View fcm.cpp
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pi;
struct disj{
int pa[2000005];
void init(int n){
for(int i=0; i<=n; i++) pa[i] = i;
}
View fft.cpp
typedef long long lint;
namespace fft{
typedef complex<double> base;
void fft(vector<base> &v, bool inv){
vector<base> w(v.size());
for(int i=2; i<=v.size(); i<<=1){
int bsz = v.size() / i;
base ang(cos(2 * M_PI / i), sin(2 * M_PI / i));
if(inv) ang = base(1, 0) / ang;