ugilib/base/definitions.hpp

• View this file on GitHub
• Last update: 2024-04-03 22:46:30+09:00
• Include: #include "ugilib/base/definitions.hpp"

Required by

• tests/graph/topological_sort.notest.cpp
• ugilib/base/constants.hpp
• ビット全探索 (ugilib/bit/bit_exhaustive_search.hpp)
• 数値 -> ビット配列 (ugilib/bit/bit_util.hpp)
• 編集距離 (ugilib/dp/edit_distance.hpp)
• 最長増加部分列 (ugilib/dp/lis.hpp)
• 二つの長方形の重なりを判定 (ugilib/geometry/rectangle_overlap.hpp)
• 0or1幅優先探索. 01BFS (ugilib/graph/bfs.hpp)
• ダイクストラ法 (ugilib/graph/dijkstra.hpp)
• 巡回セールスマン問題を解くDP (ugilib/graph/tsp.hpp)
• 全ての順列/組み合わせに対する処理を簡略化する関数 (ugilib/iteration/all_combinations.hpp)
• イテレータの範囲に含まれる要素の出現回数をカウントする (ugilib/iteration/counter.hpp)
• 次の組み合わせを生成する (ugilib/iteration/next_combination.hpp)
• 組み合わせ計算の関数の定義. perm(), comb(), fact(). (ugilib/math/combinatorics.hpp)
• 逆元計算の関数の定義. invmod(). (ugilib/math/invmod.hpp)
• 繰り返し二乗法 (ugilib/math/pow.hpp)

Verified with

• tests/bit/bit_exhaustive_search.test.cpp
• tests/dp/edit_distance.test.cpp
• tests/dp/lis.test.cpp
• tests/geometry/rectangle_overlap.test.cpp
• tests/graph/bfs.test.cpp
• tests/graph/dijkstra.test.cpp
• tests/graph/tsp.test.cpp
• tests/iteration/combinations.test.cpp
• tests/iteration/counter.test.cpp
• tests/math/enum_divisors.test.cpp
• tests/math/pow.test.cpp
• tests/math/prime_enumerate.test.cpp
• tests/math/prime_fuctorization.test.cpp

Code

#pragma once

using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define rep(i, n) for(size_t i = 0; i < n; i++)  // rep macro
#define all(v) begin(v), end(v)  // all iterator

#line 2 "ugilib/base/definitions.hpp"

using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define rep(i, n) for(size_t i = 0; i < n; i++)  // rep macro
#define all(v) begin(v), end(v)  // all iterator

Back to top page