共通ヘッダー
(cpp/template/small_template.hpp)

• View this file on GitHub
• Last update: 2024-10-19 16:46:12+09:00
• Include: #include "cpp/template/small_template.hpp"

一括インクルード、 std:: の省略

#include <bits/stdc++.h>
using namespace std;

型の略記

using ll = int64_t;
using ull = uint64_t;
using ld = long double;

long long ではなく、 long として扱われる。

定数

constexpr ll INF = 4e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;

INF + INF がオーバーフローしないように

Required by

• 群 (Group) (cpp/algebraic_structure/group.hpp)
• モノイド (Monoid) (cpp/algebraic_structure/monoid.hpp)
• cpp/algebraic_structure/monoid_lazy.hpp
• 1次元累積和 (cpp/array/cumulative_sum.hpp)
• cpp/array/doubling.hpp
• cpp/array/element_count.hpp
• 個数を数える (cpp/array/search_util.hpp)
• 座標圧縮 O(n log n) (cpp/array/sort_util.hpp)
• cpp/fps/convolution.hpp
• cpp/geometry/line.hpp
• cpp/geometry/polygon.hpp
• cpp/geometry/vector.hpp
• cpp/graph/bellman_ford.hpp
• cpp/graph/dijkstra.hpp
• cpp/graph/edge.hpp
• cpp/graph/edge_flow.hpp
• cpp/graph/find_cycle.hpp
• cpp/graph/graph_flow.hpp
• グラフ (隣接リスト形式) (cpp/graph/graph_list.hpp)
• cpp/graph/graph_matrix.hpp
• cpp/graph/lowlink.hpp
• cpp/graph/prim.hpp
• cpp/graph/topological_sort.hpp
• cpp/graph/warshall_floyd.hpp
• 区間 [start, end) (cpp/interval/interval.hpp)
• 区間の和集合 (cpp/interval/interval_union.hpp)
• 剰余を取り[0, mod)に収めるint (cpp/modint/dynamic_modint.hpp)
• 剰余を取り[0, mod)に収めるint (cpp/modint/modint.hpp)
• cpp/number/ratio.hpp
• cpp/number/square_matrix.hpp
• cpp/number_theory/enumerate_quotients.hpp
• cpp/number_theory/factorize.hpp
• cpp/number_theory/floor_sum.hpp
• cpp/number_theory/is_prime.hpp
• cpp/random/xorshift.hpp
• Binary Indexed Tree (Fenwick Tree) (cpp/segment_tree/binary_indexed_tree.hpp)
• セグメント木 based on ACL (cpp/segment_tree/lazy_segment_tree.hpp)
• セグメント木 based on ACL (cpp/segment_tree/segment_tree.hpp)
• cpp/segment_tree/segment_tree_beats.hpp
• cpp/segment_tree/segment_tree_beats_sum.hpp
• 重複ありの集合 (cpp/set/multiset.hpp)
• 重複なしの集合 (cpp/set/set.hpp)
• ランレングス圧縮 (cpp/string/char_count.hpp)
• cpp/string/rolling_hash.hpp
• 全方位木DP (cpp/tree/tree.hpp)
• cpp/union_find/disjoint_set_union.hpp
• cpp/union_find/union_find.hpp

Verified with

• cpp/verify/articulation_points.test.cpp
• cpp/verify/bellman_ford.test.cpp
• cpp/verify/bridges.test.cpp
• cpp/verify/convex_hull.test.cpp
• cpp/verify/detect_cycle_directed.test.cpp
• cpp/verify/detect_cycle_directed_2.test.cpp
• cpp/verify/dijkstra.test.cpp
• cpp/verify/dijkstra2.test.cpp
• cpp/verify/disjoint_set_union.test.cpp
• cpp/verify/enumerate_quotients.test.cpp
• cpp/verify/factorize.test.cpp
• cpp/verify/factorize2.test.cpp
• cpp/verify/is_prime.test.cpp
• cpp/verify/jump_on_tree.test.cpp
• cpp/verify/lowest_common_ancestor.test.cpp
• cpp/verify/many_a_plus_b.test.cpp
• cpp/verify/max_flow.test.cpp
• cpp/verify/maximum_profit.test.cpp
• cpp/verify/min_cost_flow.test.cpp
• cpp/verify/multi_set.test.cpp
• cpp/verify/multi_set_2.test.cpp
• cpp/verify/multi_set_3.test.cpp
• cpp/verify/point_add_range_sum.test.cpp
• cpp/verify/point_set_range_composite.test.cpp
• cpp/verify/prim.test.cpp
• cpp/verify/range_add_query.test.cpp
• cpp/verify/range_add_range_min.test.cpp
• cpp/verify/range_add_range_sum.test.cpp
• cpp/verify/range_chmax_chmin_add_range_sum.test.cpp
• cpp/verify/range_update_query.test.cpp
• cpp/verify/range_update_range_min.test.cpp
• cpp/verify/range_update_range_sum.test.cpp
• cpp/verify/sort_points_by_argument.test.cpp
• cpp/verify/tree_diameter.test.cpp
• cpp/verify/tree_diameter_2.test.cpp
• cpp/verify/tree_height.test.cpp
• cpp/verify/warshall_floyd.test.cpp

Code

#pragma once
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
constexpr ll INF = 4e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;

#line 2 "cpp/template/small_template.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
constexpr ll INF = 4e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;

Back to top page