template/io.hpp

• View this file on GitHub
• Last update: 2023-08-27 22:59:16+09:00
• Include: #include "template/io.hpp"

Required by

• template/template.hpp

Verified with

• test/aoj/aoj_2235.test.cpp
• test/aoj/aoj_2450.test.cpp
• test/aoj/aoj_3086.test.cpp
• test/aoj/aoj_grl_1_a.test.cpp
• test/aoj/aoj_grl_1_b.test.cpp
• test/convolution/Min_Plus_Convolution_Convex_and_Arbitary.test.cpp
• test/data_structure/Area_of_Union_of_Rectangles.test.cpp
• test/data_structure/Double-Ended_Priority_Queue.test.cpp
• test/data_structure/Range_Affine_Point_Get.test.cpp
• test/data_structure/Range_Affine_Point_Get_Dynamic_Segtree.test.cpp
• test/data_structure/Range_Affine_Range_Sum.test.cpp
• test/data_structure/Range_Parallel_DSU.test.cpp
• test/data_structure/Rectangle_Add_Point_Get.test.cpp
• test/data_structure/Static_Rectangle_Sum.test.cpp
• test/graph/Chromatic_Number.test.cpp
• test/graph/Cycle_Detection_Directed.test.cpp
• test/graph/Cycle_Detection_Undirected.test.cpp
• test/graph/Directed_MST.test.cpp
• test/graph/Eulerian_Trail_Directed.test.cpp
• test/graph/Eulerian_Trail_Undirected.test.cpp
• test/graph/Manhattan_MST.test.cpp
• test/graph/Maximum_Independent_Set.test.cpp
• test/graph/Minimum_Spanning_Tree.test.cpp
• test/graph/Shortest_Path.test.cpp
• test/graph/dijkstra.test.cpp
• test/graph/fibonacci_heap.test.cpp
• test/math/Binomial_Coefficient_Prime_Mod.test.cpp
• test/math/Catalan_Convolution.test.cpp
• test/math/Factorial.test.cpp
• test/math/Stern-Brocot_Tree.test.cpp
• test/math/Sum_of_Totient_Function.test.cpp
• test/matrix/Determinant_of_Matrix_2.test.cpp
• test/matrix/Determinant_of_Matrix_Arbitrary_Mod.test.cpp
• test/matrix/Inverse_Matrix.test.cpp
• test/matrix/Matrix_Product.test.cpp
• test/matrix/Pow_of_Matrix.test.cpp
• test/matrix/Rank_of_Matrix.test.cpp
• test/matrix/System_of_Linear_Equations.test.cpp
• test/polynomial/Multipoint_Evaluation.test.cpp
• test/polynomial/Polynomial_Interpolation.test.cpp
• test/tree/Cartesian_Tree.test.cpp
• test/tree/Frequency_Table_of_Tree_Distance_MODE_0.test.cpp
• test/tree/Frequency_Table_of_Tree_Distance_MODE_1.test.cpp
• test/tree/Frequency_Table_of_Tree_Distance_MODE_2.test.cpp
• test/tree/Point_Set_Tree_Path_Composition_Sum_Fixed_Root.test.cpp
• test/tree/Vertex_Add_Range_Contour_Sum_on_Tree.test.cpp
• test/tree/Vertex_Add_Range_Contour_Sum_on_Tree_2.test.cpp
• test/tree/Vertex_Get_Range_Contour_Add_on_Tree.test.cpp
• test/yuki/yuki_1038.test.cpp
• test/yuki/yuki_1077.test.cpp
• test/yuki/yuki_1145.test.cpp
• test/yuki/yuki_1796.test.cpp
• test/yuki/yuki_2439.test.cpp
• test/yuki/yuki_2747.test.cpp
• test/yuki/yuki_901.test.cpp
• test/yuki/yuki_901_2.test.cpp
• test/yuki/yuki_952.test.cpp

Code

#pragma once

#include <iomanip>
#include <iostream>
#include <optional>
#include <vector>

namespace ebi {

template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {
    return os << pa.first << " " << pa.second;
}

template <typename T1, typename T2>
std::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {
    return os >> pa.first >> pa.second;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {
    for (std::size_t i = 0; i < vec.size(); i++)
        os << vec[i] << (i + 1 == vec.size() ? "" : " ");
    return os;
}

template <typename T>
std::istream &operator>>(std::istream &os, std::vector<T> &vec) {
    for (T &e : vec) std::cin >> e;
    return os;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {
    if (opt) {
        os << opt.value();
    } else {
        os << "invalid value";
    }
    return os;
}

void fast_io() {
    std::cout << std::fixed << std::setprecision(15);
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
}

}  // namespace ebi

#line 2 "template/io.hpp"

#include <iomanip>
#include <iostream>
#include <optional>
#include <vector>

namespace ebi {

template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {
    return os << pa.first << " " << pa.second;
}

template <typename T1, typename T2>
std::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {
    return os >> pa.first >> pa.second;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {
    for (std::size_t i = 0; i < vec.size(); i++)
        os << vec[i] << (i + 1 == vec.size() ? "" : " ");
    return os;
}

template <typename T>
std::istream &operator>>(std::istream &os, std::vector<T> &vec) {
    for (T &e : vec) std::cin >> e;
    return os;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {
    if (opt) {
        os << opt.value();
    } else {
        os << "invalid value";
    }
    return os;
}

void fast_io() {
    std::cout << std::fixed << std::setprecision(15);
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
}

}  // namespace ebi

Back to top page