lib/template/template.hpp

• View this file on GitHub
• Last update: 2025-06-13 13:22:21+09:00
• Include: #include "lib/template/template.hpp"

Required by

• 多倍長整数 (lib/data_structure/bigint.hpp)
• lib/fft/fft.hpp
• lib/fft/fft_mod.hpp
• lib/fft/formal_power_series.hpp
• 畳み込み (lib/fft/ntt.hpp)
• 任意mod畳み込み (lib/fft/ntt_mod.hpp)
• Convex Hull Trick (lib/geometry/cht.hpp)
• lib/geometry/geometry.hpp
• lib/geometry/geometry3d.hpp
• ワーシャルフロイド法 (lib/graph/floyd_warshall.hpp)
• lib/math/bell.hpp
• Bostan-Mori法 (lib/math/bostan_mori.hpp)
• lib/template/atcoder.hpp
• lib/template/library_checker.hpp
• 重心分解 (lib/tree/centroid_decomposition.hpp)
• DSU on Tree (lib/tree/dsu_on_tree.hpp)
• Link-Cut Tree (lib/tree/link_cut_tree.hpp)
• Stern-Brocot 木 (lib/tree/stern_brocot_tree.hpp)

Verified with

• test/aoj/cgl/counter-clockwise.test.cpp
• test/aoj/cgl/cross_point.test.cpp
• test/aoj/cgl/intersection.test.cpp
• test/aoj/cgl/parallel_orthogonal.test.cpp
• test/aoj/cgl/projection.test.cpp
• test/aoj/cgl/reflection.test.cpp
• test/aoj/challenge/1208.test.cpp
• test/aoj/grl/floyd_warshall.test.cpp
• test/aoj/jag/dsu_on_tree.test.cpp
• test/aoj/jag/dynamic_union_find.test.cpp
• test/aoj/jag/hopcroft_karp.test.cpp
• test/aoj/ntl/addition.test.cpp
• test/aoj/ntl/difference.test.cpp
• test/aoj/ntl/division.test.cpp
• test/aoj/ntl/multiplication.test.cpp
• test/aoj/ntl/multiplication2.test.cpp
• test/aoj/ntl/remainder.test.cpp
• test/yosupo/convolution/convolution.test.cpp
• test/yosupo/convolution/convolution_mod.test.cpp
• test/yosupo/data_structure/addition_of_big_integers.test.cpp
• test/yosupo/data_structure/dynamic_tree_vertex_add_path_sum.test.cpp
• test/yosupo/enumerative_conbinatorics/bell_number.test.cpp
• test/yosupo/graph/shortest_path.test.cpp
• test/yosupo/math/bostan_mori.test.cpp
• test/yosupo/polynomial/division_of_polynomials.test.cpp
• test/yosupo/polynomial/exp_of_formal_power_series.test.cpp
• test/yosupo/polynomial/inv_of_formal_power_series.test.cpp
• test/yosupo/polynomial/log_of_formal_power_series.test.cpp
• test/yosupo/polynomial/multipoint_evaluation.test.cpp
• test/yosupo/polynomial/polynomial_interpolation.test.cpp
• test/yosupo/polynomial/polynomial_taylor_shift.test.cpp
• test/yosupo/polynomial/pow_of_formal_power_series.test.cpp
• test/yosupo/polynomial/product_of_polynomial_sequence.test.cpp
• test/yosupo/sample/many_a+b.test.cpp
• test/yosupo/tree/vertex_add_subtree_sum.2.test.cpp

Code

#pragma once
#pragma GCC optimize("Ofast,fast-math,unroll-all-loops")
#include <bits/stdc++.h>
#if !defined(ATCODER) && !defined(EVAL)
#pragma GCC target("sse4.2,avx2,bmi2")
#endif
template <class T, class U>
constexpr bool chmax(T &a, const U &b) {
    return a < (T)b ? a = (T)b, true : false;
}
template <class T, class U>
constexpr bool chmin(T &a, const U &b) {
    return (T)b < a ? a = (T)b, true : false;
}
constexpr std::int64_t INF = 1000000000000000003;
constexpr int Inf = 1000000003;
constexpr double EPS = 1e-7;
constexpr double PI = 3.14159265358979323846;

#line 2 "lib/template/template.hpp"
#pragma GCC optimize("Ofast,fast-math,unroll-all-loops")
#include <bits/stdc++.h>
#if !defined(ATCODER) && !defined(EVAL)
#pragma GCC target("sse4.2,avx2,bmi2")
#endif
template <class T, class U>
constexpr bool chmax(T &a, const U &b) {
    return a < (T)b ? a = (T)b, true : false;
}
template <class T, class U>
constexpr bool chmin(T &a, const U &b) {
    return (T)b < a ? a = (T)b, true : false;
}
constexpr std::int64_t INF = 1000000000000000003;
constexpr int Inf = 1000000003;
constexpr double EPS = 1e-7;
constexpr double PI = 3.14159265358979323846;

Back to top page