mirror of
https://gitlab.com/mfocko/Codeforces.git
synced 2024-09-19 17:16:55 +02:00
130 lines
2 KiB
C++
130 lines
2 KiB
C++
#include <algorithm>
|
||
#include <array>
|
||
#include <bit>
|
||
#include <bitset>
|
||
#include <cassert>
|
||
#include <cctype>
|
||
#include <chrono>
|
||
#include <cmath>
|
||
#include <cstdint>
|
||
#include <functional>
|
||
#include <iomanip>
|
||
#include <iostream>
|
||
#include <map>
|
||
#include <numeric>
|
||
#include <optional>
|
||
#include <queue>
|
||
#include <random>
|
||
#include <set>
|
||
#include <sstream>
|
||
#include <string>
|
||
#include <vector>
|
||
|
||
template <typename T, typename U>
|
||
std::ostream &operator<<(std::ostream &s, std::pair<T, U> const &p) {
|
||
return s << p.first << " " << p.second;
|
||
}
|
||
|
||
namespace helpers {
|
||
|
||
namespace math {
|
||
|
||
static constexpr std::int32_t MODULO = 1000000007;
|
||
|
||
long pow(long base, long exp) {
|
||
if (exp == 0) return 1;
|
||
long half = pow(base, exp / 2);
|
||
if (exp % 2 == 0) return half * half;
|
||
return half * half * base;
|
||
}
|
||
|
||
} // namespace math
|
||
|
||
namespace input {
|
||
|
||
template <typename T>
|
||
std::vector<T> load_vector(std::size_t size) {
|
||
std::vector<T> result{};
|
||
|
||
for (auto i = 0u; i < size; ++i) {
|
||
T x;
|
||
std::cin >> x;
|
||
result.push_back(std::move(x));
|
||
}
|
||
|
||
return result;
|
||
}
|
||
|
||
} // namespace input
|
||
|
||
namespace output {
|
||
|
||
template <typename T>
|
||
inline void answer(const T &ans) {
|
||
std::cout << ans << "\n";
|
||
}
|
||
|
||
inline void yes() { std::cout << "YES\n"; }
|
||
inline void no() { std::cout << "NO\n"; }
|
||
inline void yesno(bool ans) { std::cout << (ans ? "YES" : "NO") << "\n"; }
|
||
|
||
} // namespace output
|
||
|
||
using namespace std;
|
||
|
||
using namespace math;
|
||
using namespace input;
|
||
using namespace output;
|
||
|
||
#define LOOP(var, n) for (auto var = 0; var < n; ++var)
|
||
|
||
} // namespace helpers
|
||
|
||
// for ‹N› test cases, uncomment for single test case
|
||
// #define SINGLE
|
||
|
||
namespace solution {
|
||
|
||
using namespace std;
|
||
using namespace helpers;
|
||
|
||
void solve() {
|
||
// TODO
|
||
}
|
||
|
||
} // namespace solution
|
||
|
||
using namespace solution;
|
||
|
||
#ifdef TEST
|
||
|
||
#include "../.common/cpp/catch_amalgamated.hpp"
|
||
|
||
TEST_CASE("examples") {
|
||
// TODO
|
||
}
|
||
|
||
#else
|
||
|
||
int main(void) {
|
||
|
||
#ifdef SINGLE
|
||
|
||
solution::solve();
|
||
|
||
#else
|
||
|
||
// for multiple test cases
|
||
int N;
|
||
std::cin >> N >> std::ws;
|
||
|
||
for (auto i = 0; i < N; ++i) {
|
||
solution::solve();
|
||
}
|
||
|
||
#endif
|
||
|
||
return 0;
|
||
}
|
||
|
||
#endif
|