src/template.hpp

• View this file on GitHub
• Last update: 2025-10-07 04:08:36+09:00
• Include: #include "src/template.hpp"

Required by

• src/binomial.hpp
• src/BucketDecomposition.hpp
• src/dsu.hpp
• src/dsu_rollback.hpp
• src/dsu_weighted.hpp
• src/dual_segtree.hpp
• src/dynamic_segtree.hpp
• src/fenwick_tree.hpp
• src/lazy_segtree.hpp
• src/maximal_independent_set.hpp
• src/merge_sort_tree.hpp
• src/modint.hpp
• Segment Tree (src/segtree.hpp)
• src/segtree2d.hpp
• src/test/atc_abc357_f.cpp
• src/topological_sort.hpp

Verified with

• src/test/aoj_2907.cpp
• src/test/aoj_DSL_1_A.cpp
• src/test/aoj_DSL_2_A.cpp
• src/test/aoj_DSL_2_B.cpp
• src/test/aoj_DSL_2_D.cpp
• src/test/yosupo_maximum_independent_set.cpp
• src/test/yosupo_point_add_range_sum.cpp
• src/test/yosupo_point_add_rectangle_sum.cpp

Code

#pragma once
#include <bits/stdc++.h>
using namespace std;
#define si(a) (long)a.size()
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define rep(i, n) for(long i = 0; i < (long)(n); ++i)
template<typename T> bool chmin(T& a, T b) { return b < a ? (a = b, 1) : 0; }
template<typename T> bool chmax(T& a, T b) { return b > a ? (a = b, 1) : 0; }
struct _ {
    _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0), cout << fixed << setprecision(16); }
} __;

#line 2 "src/template.hpp"
#include <bits/stdc++.h>
using namespace std;
#define si(a) (long)a.size()
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define rep(i, n) for(long i = 0; i < (long)(n); ++i)
template<typename T> bool chmin(T& a, T b) { return b < a ? (a = b, 1) : 0; }
template<typename T> bool chmax(T& a, T b) { return b > a ? (a = b, 1) : 0; }
struct _ {
    _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0), cout << fixed << setprecision(16); }
} __;

Back to top page