template.h

• View this file on GitHub
• Last update: 2025-05-07 22:18:34+07:00

Required by

• Big_Integer/BigInt.h
• Big_Integer/BigInt_full.h
• DataStructure/Aizu/test_dsu_2d.cpp
• DataStructure/Aizu/test_dsu_2d_2.cpp
• DataStructure/DSU/Dsu.h
• DataStructure/DSU/Dsu_2D.h
• DataStructure/DSU/Weighted_Dsu.h
• DataStructure/Fenwick/Fenwick.h
• DataStructure/Problem/Mo1.cpp
• DataStructure/Problem/Mo2.cpp
• DataStructure/Problem/PersistentSegTree1.cpp
• DataStructure/Problem/PersistentSegTree2.cpp
• DataStructure/Problem/SegTreeBeats1.cpp
• DataStructure/Problem/SegTreeBeats2.cpp
• DataStructure/Problem/SegTreeBeats3.cpp
• DataStructure/Problem/Sqrt_split_rebuild1.cpp
• DataStructure/Problem/Sqrt_split_rebuild2.cpp
• DataStructure/RMQ/RMQ.h
• DataStructure/SegTree/Affline.h
• DataStructure/SegTree/LazySegTree.h
• DataStructure/SegTree/PersistentSegTree.h
• DataStructure/SegTree/SegTree.h
• DataStructure/SegTree/SegTreeBeats1.h
• DataStructure/SegTree/SegTreeBeats2.h
• DataStructure/SegTree/SegTreeBeats3.h
• DataStructure/SegTree/SparseSegTree.h
• DataStructure/SqrtDecomposition/Split_Rebuild/Full_version.h
• DataStructure/SqrtDecomposition/Split_Rebuild/Simplified_version.h
• DataStructure/SqrtDecomposition/Sqrt.h
• DataStructure/Yosupo/Point_set_range_composite.brute_force.cpp
• Dp/DAG.h
• Dp/Knapsack.h
• Dp/LCS.h
• Graph/Mst/Kruskal.h
• Graph/Mst/Prim.h
• Graph/Shortest_path/Bellman_ford.h
• Graph/Shortest_path/Dijkstra.h
• Graph/Shortest_path/Floyd_warshall.h
• Misc/Compress.h
• Misc/Deque.h
• Misc/Formula.h
• Misc/LIS.h
• Misc/MITM.h
• Misc/Matrix.h
• Misc/Modint.h
• Misc/Prefix_sum.h
• Misc/Small_to_large.h
• NumberTheory/Math/Binary_exponentiation.h
• NumberTheory/Math/CheckPrime.h
• NumberTheory/Math/Divisors.h
• NumberTheory/Math/EulerPhi.h
• NumberTheory/Math/Extended_euclid.h
• NumberTheory/Math/Factorial.h
• NumberTheory/Math/Factorization.h
• NumberTheory/Math/MillerRabin.h
• NumberTheory/Math/Misc.h
• NumberTheory/Math/Primality_test.h
• NumberTheory/Math/Sieve.h
• String/Kmp.h
• String/Problem/Kmp.cpp
• String/Problem/Rolling_Hash1.cpp
• String/Problem/Rolling_Hash2.cpp
• String/Rolling_Hash.h
• String/Trie/Trie.h
• String/Trie/Trie_array_ver.h
• String/Z_Function.h
• Tree/EulerTour.h
• Tree/Tree/BinaryLifting.h
• Tree/Tree/Lca.h
• Tree/Tree_diameter.h

Verified with

• Big_Integer/Aizu/Addition_of_Big_Integers.test.cpp
• Big_Integer/Aizu/Difference_of_Big_Integers.test.cpp
• Big_Integer/Aizu/Division_of_Big_Integers.test.cpp
• Big_Integer/Aizu/Multiplication_of_Big_Integers.test.cpp
• Big_Integer/Aizu/Multiplication_of_Big_Integers_II.test.cpp
• Big_Integer/Aizu/Remainder_of_Big_Integers.test.cpp
• Big_Integer/Yosupo/Addition_of_Big_Integers.test.cpp
• DataStructure/Aizu/aizu_dsl_1_b_weighted_dsu.test.cpp
• DataStructure/Yosupo/Associative_array.test.cpp
• DataStructure/Yosupo/Double_end_priority_queue.test.cpp
• DataStructure/Yosupo/Ordered_set.test.cpp
• DataStructure/Yosupo/Point_add_range_sum.test.cpp
• DataStructure/Yosupo/Predecessor_problem.test.cpp
• DataStructure/Yosupo/Range_affine_point_get.test.cpp
• DataStructure/Yosupo/Range_affine_range_sum.test.cpp
• DataStructure/Yosupo/Range_affine_range_sum_large_array.test.cpp
• DataStructure/Yosupo/Range_chmin_chmax_add_range_sum.test.cpp
• DataStructure/Yosupo/Range_reverse_range_sum.test.cpp
• DataStructure/Yosupo/Static_RMQ.test.cpp
• DataStructure/Yosupo/Static_range_sum.test.cpp
• DataStructure/Yosupo/Union_find.test.cpp
• DataStructure/Yosupo/Unionfind_with_potential.test.cpp
• Graph/Aizu/aizu_grl_1_a_dijkstra.test.cpp
• Graph/Aizu/aizu_grl_1_b_negative_cycle.test.cpp
• Graph/Aizu/aizu_grl_1_c_floyd_warshall.test.cpp
• Graph/Aizu/aizu_grl_2_a_minimum_spanning_tree.test.cpp
• NumberTheory/Aizu/aizu_ntl_1_a_prime_factor.test.cpp
• NumberTheory/Aizu/aizu_ntl_1_b_power_mod.test.cpp
• NumberTheory/Aizu/aizu_ntl_1_c_lcm.test.cpp
• NumberTheory/Aizu/aizu_ntl_1_d_euler_phi.test.cpp
• NumberTheory/Aizu/aizu_ntl_1_e_extended_euclid.test.cpp
• NumberTheory/Yosupo/Counting_primes.test.cpp
• NumberTheory/Yosupo/Enumerate_primes.test.cpp
• NumberTheory/Yosupo/Enumerate_quotients.test.cpp
• NumberTheory/Yosupo/Primality_test.test.cpp
• Sample/A_plus_B.test.cpp
• Sample/Many_A_plus_B.test.cpp
• Sample/Many_A_plus_B_128bit.test.cpp
• String/Yosupo/Z_Algorithm.test.cpp
• Tree/Yosupo/Diameter_tree.test.cpp
• Tree/Yosupo/Jump_on_tree.test.cpp
• Tree/Yosupo/Lowest_common_ancestor.test.cpp
• Tree/Yosupo/Vertex_add_subtree_sum.test.cpp

Code

#pragma once

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define MOD (ll)(1e9+7)
#define all(x) (x).begin(),(x).end()
#define unique(x) x.erase(unique(all(x)), x.end())
#define INF32 ((1ull<<31)-1)
#define INF64 ((1ull<<63)-1)
#define inf (ll)1e18

#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

const int mod = 998244353;

void solve();

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // cin.exceptions(cin.failbit);
    // int t; cin >> t;
    // while(t--)
        solve();
    cerr << "\nTime run: " << 1000 * clock() / CLOCKS_PER_SEC << "ms" << '\n';
    return 0;
}

#line 2 "template.h"

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define MOD (ll)(1e9+7)
#define all(x) (x).begin(),(x).end()
#define unique(x) x.erase(unique(all(x)), x.end())
#define INF32 ((1ull<<31)-1)
#define INF64 ((1ull<<63)-1)
#define inf (ll)1e18

#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

const int mod = 998244353;

void solve();

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // cin.exceptions(cin.failbit);
    // int t; cin >> t;
    // while(t--)
        solve();
    cerr << "\nTime run: " << 1000 * clock() / CLOCKS_PER_SEC << "ms" << '\n';
    return 0;
}

Back to top page