template/inout.hpp
- View this file on GitHub
- Last update: 2025-10-17 21:43:09+09:00
- Include:
#include "template/inout.hpp"
Required by
Verified with
verify/convolution/LC_convolution_mod.test.cpp
verify/convolution/LC_convolution_mod_1000000007.test.cpp
verify/convolution/LC_gcd_convolution.test.cpp
verify/convolution/LC_lcm_convolution.test.cpp
verify/convolution/LC_min_plus_convolution_convex_arbitrary.test.cpp
verify/convolution/LC_min_plus_convolution_convex_convex.test.cpp
verify/data-structure/LC_point_add_range_sum.test.cpp
verify/data-structure/LC_predecessor_problem.test.cpp
verify/data-structure/LC_staticrmq.test.cpp
verify/flow/AOJ_GRL_6_A.test.cpp
verify/fps/LC_composition_of_formal_power_series.test.cpp
verify/fps/LC_composition_of_formal_power_series_large.test.cpp
verify/fps/LC_compositional_inverse_of_formal_power_series.test.cpp
verify/fps/LC_compositional_inverse_of_formal_power_series_large.test.cpp
verify/fps/LC_consecutive_terms_of_linear_recurrent_sequence.test.cpp
verify/fps/LC_convolution_mod.relaxed.test.cpp
verify/fps/LC_convolution_mod.semirelaxed.test.cpp
verify/fps/LC_division_of_polynomials.test.cpp
verify/fps/LC_exp_of_formal_power_series.relaxed.test.cpp
verify/fps/LC_exp_of_formal_power_series.test.cpp
verify/fps/LC_exp_of_formal_power_series_sparse.test.cpp
verify/fps/LC_find_linear_recurrence.test.cpp
verify/fps/LC_inv_of_formal_power_series.relaxed.test.cpp
verify/fps/LC_inv_of_formal_power_series.test.cpp
verify/fps/LC_inv_of_formal_power_series_sparse.test.cpp
verify/fps/LC_kth_term_of_linearly_recurrent_sequence.test.cpp
verify/fps/LC_log_of_formal_power_series.relaxed.test.cpp
verify/fps/LC_log_of_formal_power_series.test.cpp
verify/fps/LC_log_of_formal_power_series_sparse.test.cpp
verify/fps/LC_multipoint_evaluation.test.cpp
verify/fps/LC_multipoint_evaluation_on_geometric_sequence.test.cpp
verify/fps/LC_polynomial_interpolation.test.cpp
verify/fps/LC_polynomial_taylor_shift.test.cpp
verify/fps/LC_pow_of_formal_power_series.test.cpp
verify/fps/LC_pow_of_formal_power_series_sparse.test.cpp
verify/fps/LC_product_of_polynomial_sequence.test.cpp
verify/fps/LC_shift_of_sampling_points_of_polynomial.test.cpp
verify/fps/LC_sqrt_of_formal_power_series.relaxed.test.cpp
verify/fps/LC_sqrt_of_formal_power_series.test.cpp
verify/fps/LC_sqrt_of_formal_power_series_sparse.test.cpp
verify/fps/LC_sum_of_exponential_times_polynomial.test.cpp
verify/fps/LC_sum_of_exponential_times_polynomial_limit.test.cpp
verify/fps/UNIT_prefix_sum_of_polynomial.test.cpp
verify/math/LC_stern_brocot_tree.test.cpp
verify/math/LC_sum_of_floor_of_linear.monoid.test.cpp
verify/math/LC_sum_of_floor_of_linear.test.cpp
verify/number-theory/LC_counting_primes.test.cpp
verify/number-theory/LC_enumerate_quotients.test.cpp
verify/segment-tree/LC_point_add_range_sum.pow2.test.cpp
verify/segment-tree/LC_point_add_range_sum.test.cpp
verify/segment-tree/LC_point_set_range_composite.test.cpp
verify/segment-tree/LC_range_affine_point_get.test.cpp
verify/segment-tree/LC_range_affine_range_sum.test.cpp
verify/set/LC_bitwise_and_convolution.or.test.cpp
verify/set/LC_bitwise_and_convolution.test.cpp
verify/set/LC_bitwise_xor_convolution.test.cpp
verify/set/LC_exp_of_set_power_series.test.cpp
verify/set/LC_polynomial_composite_set_power_series.test.cpp
verify/set/LC_subset_convolution.test.cpp
verify/set/UNIT_composite_set_power_series.test.cpp
verify/union-find/LC_unionfind.test.cpp
verify/union-find/LC_unionfind_with_potential.test.cpp
Code
#pragma once
struct Fast {
Fast() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} fast;
template <class T1, class T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
return is >> p.first >> p.second;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << p.first << " " << p.second;
}
template <class T>
istream &operator>>(istream &is, vector<T> &a) {
for (auto &v : a) is >> v;
return is;
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &a) {
for (auto it = a.begin(); it != a.end();) {
os << *it;
if (++it != a.end()) os << " ";
}
return os;
}
template <class T>
ostream &operator<<(ostream &os, const set<T> &st) {
os << "{";
for (auto it = st.begin(); it != st.end();) {
os << *it;
if (++it != st.end()) os << ",";
}
os << "}";
return os;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
os << "{";
for (auto it = mp.begin(); it != mp.end();) {
os << it->first << ":" << it->second;
if (++it != mp.end()) os << ",";
}
os << "}";
return os;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u)) cout << sep;
out(u...);
}#line 2 "template/inout.hpp"
struct Fast {
Fast() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} fast;
template <class T1, class T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
return is >> p.first >> p.second;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << p.first << " " << p.second;
}
template <class T>
istream &operator>>(istream &is, vector<T> &a) {
for (auto &v : a) is >> v;
return is;
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &a) {
for (auto it = a.begin(); it != a.end();) {
os << *it;
if (++it != a.end()) os << " ";
}
return os;
}
template <class T>
ostream &operator<<(ostream &os, const set<T> &st) {
os << "{";
for (auto it = st.begin(); it != st.end();) {
os << *it;
if (++it != st.end()) os << ",";
}
os << "}";
return os;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
os << "{";
for (auto it = mp.begin(); it != mp.end();) {
os << it->first << ":" << it->second;
if (++it != mp.end()) os << ",";
}
os << "}";
return os;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u)) cout << sep;
out(u...);
}