#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
//
#include "../../template/template.hpp"
//
#include "../../math-fast/radix-sort.hpp"
//
#include "../../misc/all.hpp"
using namespace Nyaan;
template <typename T>
void test(int N) {
ll mx = numeric_limits<T>::max();
if (N <= 300) {
mx = pow(2.0, rnd() * log2(numeric_limits<T>::max()));
mx = clamp<T>(mx, 1, numeric_limits<T>::max());
}
Timer timer;
{
V<T> v(N);
each(x, v) x = rng(-mx, mx);
auto w = v;
timer.reset();
radix_sort(v);
ll t1 = timer.elapsed();
timer.reset();
sort(all(w));
ll t2 = timer.elapsed();
assert(v == w);
if (N >= TEN(8)) DebugImpl::trace("N", N, "radix", t1, "std", t2);
}
if (N <= 300) {
V<pair<T, T>> v(N);
each(x, v) {
x.fi = rng(-mx, mx);
x.se = rng(-mx, mx);
}
auto w = v;
radix_sort_compare_first(v);
stable_sort(all(w), [](const pair<T, T>& a, const pair<T, T>& b) {
return a.first < b.first;
});
if (v != w) {
trc2(v);
trc2(w);
}
assert(v == w);
}
}
void q() {
{
vector<int> v{2, 0, 1, -1, -2};
radix_sort(v);
vector<int> w{-2, -1, 0, 1, 2};
assert(v == w);
}
{
vector<int> v{2, 0, 2, -1, 1, 2, 0, -1, -2};
radix_sort(v);
vector<int> w{-2, -1, -1, 0, 0, 1, 2, 2, 2};
assert(v == w);
}
{
vector<ll> v{2, 0, 2, -1, 1, 2, 0, -1, -2};
radix_sort(v);
vector<ll> w{-2, -1, -1, 0, 0, 1, 2, 2, 2};
assert(v == w);
}
rep(N, 200) rep(t, 200) {
test<int>(N);
test<uint32_t>(N);
test<ll>(N);
}
rep(e, 6) {
test<int>(TEN(e));
test<uint32_t>(TEN(e));
test<ll>(TEN(e));
}
cerr << "OK" << endl;
/*
cerr << "OK" << endl;
rep(t, 3) test<int>(TEN(7));
rep(t, 3) test<ll>(TEN(7));
*/
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
void Nyaan::solve() {
int t = 1;
// in(t);
while (t--) q();
}
#line 1 "verify/verify-unit-test/radix-sort.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
//
#line 2 "template/template.hpp"
using namespace std;
// intrinstic
#include <immintrin.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// utility
#line 1 "template/util.hpp"
namespace Nyaan {
using ll = long long;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
using vi = vector<int>;
using vl = vector<long long>;
using vd = V<double>;
using vs = V<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;
template <typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, typename U>
struct P : pair<T, U> {
template <typename... Args>
P(Args... args) : pair<T, U>(args...) {}
using pair<T, U>::first;
using pair<T, U>::second;
P &operator+=(const P &r) {
first += r.first;
second += r.second;
return *this;
}
P &operator-=(const P &r) {
first -= r.first;
second -= r.second;
return *this;
}
P &operator*=(const P &r) {
first *= r.first;
second *= r.second;
return *this;
}
template <typename S>
P &operator*=(const S &r) {
first *= r, second *= r;
return *this;
}
P operator+(const P &r) const { return P(*this) += r; }
P operator-(const P &r) const { return P(*this) -= r; }
P operator*(const P &r) const { return P(*this) *= r; }
template <typename S>
P operator*(const S &r) const {
return P(*this) *= r;
}
P operator-() const { return P{-first, -second}; }
};
using pl = P<ll, ll>;
using pi = P<int, int>;
using vp = V<pl>;
constexpr int inf = 1001001001;
constexpr long long infLL = 4004004004004004004LL;
template <typename T>
int sz(const T &t) {
return t.size();
}
template <typename T, typename U>
inline bool amin(T &x, U y) {
return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T>
inline T Max(const vector<T> &v) {
return *max_element(begin(v), end(v));
}
template <typename T>
inline T Min(const vector<T> &v) {
return *min_element(begin(v), end(v));
}
template <typename T>
inline long long Sum(const vector<T> &v) {
return accumulate(begin(v), end(v), 0LL);
}
template <typename T>
int lb(const vector<T> &v, const T &a) {
return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
return upper_bound(begin(v), end(v), a) - begin(v);
}
constexpr long long TEN(int n) {
long long ret = 1, x = 10;
for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);
return ret;
}
template <typename T, typename U>
pair<T, U> mkp(const T &t, const U &u) {
return make_pair(t, u);
}
template <typename T>
vector<T> mkrui(const vector<T> &v, bool rev = false) {
vector<T> ret(v.size() + 1);
if (rev) {
for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];
} else {
for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
}
return ret;
};
template <typename T>
vector<T> mkuni(const vector<T> &v) {
vector<T> ret(v);
sort(ret.begin(), ret.end());
ret.erase(unique(ret.begin(), ret.end()), ret.end());
return ret;
}
template <typename F>
vector<int> mkord(int N, F f) {
vector<int> ord(N);
iota(begin(ord), end(ord), 0);
sort(begin(ord), end(ord), f);
return ord;
}
template <typename T>
vector<int> mkinv(vector<T> &v) {
int max_val = *max_element(begin(v), end(v));
vector<int> inv(max_val + 1, -1);
for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
return inv;
}
vector<int> mkiota(int n) {
vector<int> ret(n);
iota(begin(ret), end(ret), 0);
return ret;
}
template <typename T>
T mkrev(const T &v) {
T w{v};
reverse(begin(w), end(w));
return w;
}
template <typename T>
bool nxp(vector<T> &v) {
return next_permutation(begin(v), end(v));
}
// 返り値の型は入力の T に依存
// i 要素目 : [0, a[i])
template <typename T>
vector<vector<T>> product(const vector<T> &a) {
vector<vector<T>> ret;
vector<T> v;
auto dfs = [&](auto rc, int i) -> void {
if (i == (int)a.size()) {
ret.push_back(v);
return;
}
for (int j = 0; j < a[i]; j++) v.push_back(j), rc(rc, i + 1), v.pop_back();
};
dfs(dfs, 0);
return ret;
}
// F : function(void(T&)), mod を取る操作
// T : 整数型のときはオーバーフローに注意する
template <typename T>
T Power(T a, long long n, const T &I, const function<void(T &)> &f) {
T res = I;
for (; n; f(a = a * a), n >>= 1) {
if (n & 1) f(res = res * a);
}
return res;
}
// T : 整数型のときはオーバーフローに注意する
template <typename T>
T Power(T a, long long n, const T &I) {
return Power(a, n, I, function<void(T &)>{[](T &) -> void {}});
}
} // namespace Nyaan
#line 58 "template/template.hpp"
// bit operation
#line 1 "template/bitop.hpp"
namespace Nyaan {
__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {
return _mm_popcnt_u64(a);
}
inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; }
template <typename T>
inline int gbit(const T &a, int i) {
return (a >> i) & 1;
}
template <typename T>
inline void sbit(T &a, int i, bool b) {
if (gbit(a, i) != b) a ^= T(1) << i;
}
constexpr long long PW(int n) { return 1LL << n; }
constexpr long long MSK(int n) { return (1LL << n) - 1; }
} // namespace Nyaan
#line 61 "template/template.hpp"
// inout
#line 1 "template/inout.hpp"
namespace Nyaan {
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
int s = (int)v.size();
for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v) is >> x;
return is;
}
istream &operator>>(istream &is, __int128_t &x) {
string S;
is >> S;
x = 0;
int flag = 0;
for (auto &c : S) {
if (c == '-') {
flag = true;
continue;
}
x *= 10;
x += c - '0';
}
if (flag) x = -x;
return is;
}
istream &operator>>(istream &is, __uint128_t &x) {
string S;
is >> S;
x = 0;
for (auto &c : S) {
x *= 10;
x += c - '0';
}
return is;
}
ostream &operator<<(ostream &os, __int128_t x) {
if (x == 0) return os << 0;
if (x < 0) os << '-', x = -x;
string S;
while (x) S.push_back('0' + x % 10), x /= 10;
reverse(begin(S), end(S));
return os << S;
}
ostream &operator<<(ostream &os, __uint128_t x) {
if (x == 0) return os << 0;
string S;
while (x) S.push_back('0' + x % 10), x /= 10;
reverse(begin(S), end(S));
return os << S;
}
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...);
}
struct IoSetupNya {
IoSetupNya() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(7);
}
} iosetupnya;
} // namespace Nyaan
#line 64 "template/template.hpp"
// debug
#line 1 "template/debug.hpp"
namespace DebugImpl {
template <typename U, typename = void>
struct is_specialize : false_type {};
template <typename U>
struct is_specialize<
U, typename conditional<false, typename U::iterator, void>::type>
: true_type {};
template <typename U>
struct is_specialize<
U, typename conditional<false, decltype(U::first), void>::type>
: true_type {};
template <typename U>
struct is_specialize<U, enable_if_t<is_integral<U>::value, void>> : true_type {
};
void dump(const char& t) { cerr << t; }
void dump(const string& t) { cerr << t; }
void dump(const bool& t) { cerr << (t ? "true" : "false"); }
void dump(__int128_t t) {
if (t == 0) cerr << 0;
if (t < 0) cerr << '-', t = -t;
string S;
while (t) S.push_back('0' + t % 10), t /= 10;
reverse(begin(S), end(S));
cerr << S;
}
void dump(__uint128_t t) {
if (t == 0) cerr << 0;
string S;
while (t) S.push_back('0' + t % 10), t /= 10;
reverse(begin(S), end(S));
cerr << S;
}
template <typename U,
enable_if_t<!is_specialize<U>::value, nullptr_t> = nullptr>
void dump(const U& t) {
cerr << t;
}
template <typename T>
void dump(const T& t, enable_if_t<is_integral<T>::value>* = nullptr) {
string res;
if (t == Nyaan::inf) res = "inf";
if constexpr (is_signed<T>::value) {
if (t == -Nyaan::inf) res = "-inf";
}
if constexpr (sizeof(T) == 8) {
if (t == Nyaan::infLL) res = "inf";
if constexpr (is_signed<T>::value) {
if (t == -Nyaan::infLL) res = "-inf";
}
}
if (res.empty()) res = to_string(t);
cerr << res;
}
template <typename T, typename U>
void dump(const pair<T, U>&);
template <typename T>
void dump(const pair<T*, int>&);
template <typename T>
void dump(const T& t,
enable_if_t<!is_void<typename T::iterator>::value>* = nullptr) {
cerr << "[ ";
for (auto it = t.begin(); it != t.end();) {
dump(*it);
cerr << (++it == t.end() ? "" : ", ");
}
cerr << " ]";
}
template <typename T, typename U>
void dump(const pair<T, U>& t) {
cerr << "( ";
dump(t.first);
cerr << ", ";
dump(t.second);
cerr << " )";
}
template <typename T>
void dump(const pair<T*, int>& t) {
cerr << "[ ";
for (int i = 0; i < t.second; i++) {
dump(t.first[i]);
cerr << (i == t.second - 1 ? "" : ", ");
}
cerr << " ]";
}
void trace() { cerr << endl; }
template <typename Head, typename... Tail>
void trace(Head&& head, Tail&&... tail) {
cerr << " ";
dump(head);
if (sizeof...(tail) != 0) cerr << ",";
trace(forward<Tail>(tail)...);
}
} // namespace DebugImpl
#ifdef NyaanDebug
#define trc(...) \
do { \
cerr << "## " << #__VA_ARGS__ << " = "; \
DebugImpl::trace(__VA_ARGS__); \
} while (0)
#else
#define trc(...) (void(0))
#endif
#ifdef NyaanLocal
#define trc2(...) \
do { \
cerr << "## " << #__VA_ARGS__ << " = "; \
DebugImpl::trace(__VA_ARGS__); \
} while (0)
#else
#define trc2(...) (void(0))
#endif
#line 67 "template/template.hpp"
// macro
#line 1 "template/macro.hpp"
#define each(x, v) for (auto&& x : v)
#define each2(x, y, v) for (auto&& [x, y] : v)
#define all(v) (v).begin(), (v).end()
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
#define reg(i, a, b) for (long long i = (a); i < (b); i++)
#define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--)
#define fi first
#define se second
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define in2(s, t) \
for (int i = 0; i < (int)s.size(); i++) { \
in(s[i], t[i]); \
}
#define in3(s, t, u) \
for (int i = 0; i < (int)s.size(); i++) { \
in(s[i], t[i], u[i]); \
}
#define in4(s, t, u, v) \
for (int i = 0; i < (int)s.size(); i++) { \
in(s[i], t[i], u[i], v[i]); \
}
#define die(...) \
do { \
Nyaan::out(__VA_ARGS__); \
return; \
} while (0)
#line 70 "template/template.hpp"
namespace Nyaan {
void solve();
}
int main() { Nyaan::solve(); }
#line 4 "verify/verify-unit-test/radix-sort.test.cpp"
//
#line 2 "math-fast/radix-sort.hpp"
#line 6 "math-fast/radix-sort.hpp"
using namespace std;
namespace RadixSortImpl {
constexpr int b = 8;
constexpr int powb = 1 << b;
constexpr int mask = powb - 1;
int cnt0[powb];
int cnt1[powb];
int cnt2[powb];
int cnt3[powb];
template <typename T>
void radix_sort(int N, T* p) {
static_assert(sizeof(T) == 4 or sizeof(T) == 8);
if (!N) return;
if (N <= 64) {
sort(p, p + N);
return;
}
static T* tmp = nullptr;
static int tmp_size = 0;
if (!tmp or tmp_size < N) {
if (tmp) delete[] tmp;
tmp_size = 1;
while (tmp_size < N) tmp_size *= 2;
tmp = new T[tmp_size];
}
memset(cnt0, 0, sizeof(cnt0));
memset(cnt1, 0, sizeof(cnt1));
memset(cnt2, 0, sizeof(cnt2));
memset(cnt3, 0, sizeof(cnt3));
for (int i = 0; i < N; i++) {
cnt0[p[i] & mask]++;
cnt1[(p[i] >> b) & mask]++;
cnt2[(p[i] >> b * 2) & mask]++;
cnt3[(p[i] >> b * 3) & mask]++;
}
for (int i = 0; i < powb - 1; i++) {
cnt0[i + 1] += cnt0[i];
cnt1[i + 1] += cnt1[i];
cnt2[i + 1] += cnt2[i];
cnt3[i + 1] += cnt3[i];
}
for (int i = N; i--;) tmp[--cnt0[p[i] & mask]] = p[i];
for (int i = N; i--;) p[--cnt1[tmp[i] >> b & mask]] = tmp[i];
for (int i = N; i--;) tmp[--cnt2[p[i] >> b * 2 & mask]] = p[i];
for (int i = N; i--;) p[--cnt3[tmp[i] >> b * 3 & mask]] = tmp[i];
if constexpr (sizeof(T) == 8) {
memset(cnt0, 0, sizeof(cnt0));
for (int i = 0; i < N; i++) cnt0[p[i] >> b * 4 & mask]++;
for (int i = 0; i < powb - 1; i++) cnt0[i + 1] += cnt0[i];
for (int i = N; i--;) tmp[--cnt0[p[i] >> b * 4 & mask]] = p[i];
memset(cnt0, 0, sizeof(cnt0));
for (int i = 0; i < N; i++) cnt0[tmp[i] >> b * 5 & mask]++;
for (int i = 0; i < powb - 1; i++) cnt0[i + 1] += cnt0[i];
for (int i = N; i--;) p[--cnt0[tmp[i] >> b * 5 & mask]] = tmp[i];
memset(cnt0, 0, sizeof(cnt0));
for (int i = 0; i < N; i++) cnt0[p[i] >> b * 6 & mask]++;
for (int i = 0; i < powb - 1; i++) cnt0[i + 1] += cnt0[i];
for (int i = N; i--;) tmp[--cnt0[p[i] >> b * 6 & mask]] = p[i];
memset(cnt0, 0, sizeof(cnt0));
for (int i = 0; i < N; i++) cnt0[tmp[i] >> b * 7 & mask]++;
for (int i = 0; i < powb - 1; i++) cnt0[i + 1] += cnt0[i];
for (int i = N; i--;) p[--cnt0[tmp[i] >> b * 7 & mask]] = tmp[i];
}
if constexpr (is_signed<T>::value) {
int i = N;
while (i and p[i - 1] < 0) i--;
rotate(p, p + i, p + N);
}
}
// N 10^7 int : 90 ms
// N 10^7 ll : 220 ms
template <typename T>
void radix_sort(vector<T>& v) {
radix_sort(v.size(), v.data());
}
// first の順にソート, second は不問
template <typename T, typename U>
void radix_sort_compare_first(int N, pair<T, U>* p) {
static_assert(sizeof(T) == 4 or sizeof(T) == 8);
if (!N) return;
if (N <= 64) {
stable_sort(p, p + N, [](const pair<T, U>& s, const pair<T, U>& t) {
return s.first < t.first;
});
return;
}
static pair<T, U>* tmp = nullptr;
static int tmp_size = 0;
if (!tmp or tmp_size < N) {
if (tmp) delete[] tmp;
tmp_size = 1;
while (tmp_size < N) tmp_size *= 2;
tmp = new pair<T, U>[tmp_size];
}
memset(cnt0, 0, sizeof(cnt0));
for (int i = 0; i < N; i++) cnt0[p[i].first & mask]++;
for (int i = 0; i < powb - 1; i++) cnt0[i + 1] += cnt0[i];
for (int i = N; i--;) tmp[--cnt0[p[i].first & mask]] = p[i];
memset(cnt0, 0, sizeof(cnt0));
for (int i = 0; i < N; i++) cnt0[tmp[i].first >> b & mask]++;
for (int i = 0; i < powb - 1; i++) cnt0[i + 1] += cnt0[i];
for (int i = N; i--;) p[--cnt0[tmp[i].first >> b & mask]] = tmp[i];
memset(cnt0, 0, sizeof(cnt0));
for (int i = 0; i < N; i++) cnt0[p[i].first >> b * 2 & mask]++;
for (int i = 0; i < powb - 1; i++) cnt0[i + 1] += cnt0[i];
for (int i = N; i--;) tmp[--cnt0[p[i].first >> b * 2 & mask]] = p[i];
memset(cnt0, 0, sizeof(cnt0));
for (int i = 0; i < N; i++) cnt0[tmp[i].first >> b * 3 & mask]++;
for (int i = 0; i < powb - 1; i++) cnt0[i + 1] += cnt0[i];
for (int i = N; i--;) p[--cnt0[tmp[i].first >> b * 3 & mask]] = tmp[i];
if constexpr (sizeof(T) == 8) {
memset(cnt0, 0, sizeof(cnt0));
for (int i = 0; i < N; i++) cnt0[p[i].first >> b * 4 & mask]++;
for (int i = 0; i < powb - 1; i++) cnt0[i + 1] += cnt0[i];
for (int i = N; i--;) tmp[--cnt0[p[i].first >> b * 4 & mask]] = p[i];
memset(cnt0, 0, sizeof(cnt0));
for (int i = 0; i < N; i++) cnt0[tmp[i].first >> b * 5 & mask]++;
for (int i = 0; i < powb - 1; i++) cnt0[i + 1] += cnt0[i];
for (int i = N; i--;) p[--cnt0[tmp[i].first >> b * 5 & mask]] = tmp[i];
memset(cnt0, 0, sizeof(cnt0));
for (int i = 0; i < N; i++) cnt0[p[i].first >> b * 6 & mask]++;
for (int i = 0; i < powb - 1; i++) cnt0[i + 1] += cnt0[i];
for (int i = N; i--;) tmp[--cnt0[p[i].first >> b * 6 & mask]] = p[i];
memset(cnt0, 0, sizeof(cnt0));
for (int i = 0; i < N; i++) cnt0[tmp[i].first >> b * 7 & mask]++;
for (int i = 0; i < powb - 1; i++) cnt0[i + 1] += cnt0[i];
for (int i = N; i--;) p[--cnt0[tmp[i].first >> b * 7 & mask]] = tmp[i];
}
if constexpr (is_signed<T>::value) {
int i = N;
while (i and p[i - 1].first < 0) i--;
rotate(p, p + i, p + N);
}
}
// first の順にソート, second は不問
// N 10^7 int : 130 ms
// N 10^7 ll : 370 ms
template <typename T, typename U>
void radix_sort_compare_first(vector<pair<T, U>>& v) {
radix_sort_compare_first(v.size(), v.data());
}
} // namespace RadixSortImpl
using RadixSortImpl::radix_sort;
using RadixSortImpl::radix_sort_compare_first;
/*
@brief radix sort
*/
#line 6 "verify/verify-unit-test/radix-sort.test.cpp"
//
#line 2 "misc/all.hpp"
#line 2 "misc/fastio.hpp"
#line 8 "misc/fastio.hpp"
using namespace std;
#line 2 "internal/internal-type-traits.hpp"
#line 4 "internal/internal-type-traits.hpp"
using namespace std;
namespace internal {
template <typename T>
using is_broadly_integral =
typename conditional_t<is_integral_v<T> || is_same_v<T, __int128_t> ||
is_same_v<T, __uint128_t>,
true_type, false_type>::type;
template <typename T>
using is_broadly_signed =
typename conditional_t<is_signed_v<T> || is_same_v<T, __int128_t>,
true_type, false_type>::type;
template <typename T>
using is_broadly_unsigned =
typename conditional_t<is_unsigned_v<T> || is_same_v<T, __uint128_t>,
true_type, false_type>::type;
#define ENABLE_VALUE(x) \
template <typename T> \
constexpr bool x##_v = x<T>::value;
ENABLE_VALUE(is_broadly_integral);
ENABLE_VALUE(is_broadly_signed);
ENABLE_VALUE(is_broadly_unsigned);
#undef ENABLE_VALUE
#define ENABLE_HAS_TYPE(var) \
template <class, class = void> \
struct has_##var : false_type {}; \
template <class T> \
struct has_##var<T, void_t<typename T::var>> : true_type {}; \
template <class T> \
constexpr auto has_##var##_v = has_##var<T>::value;
#define ENABLE_HAS_VAR(var) \
template <class, class = void> \
struct has_##var : false_type {}; \
template <class T> \
struct has_##var<T, void_t<decltype(T::var)>> : true_type {}; \
template <class T> \
constexpr auto has_##var##_v = has_##var<T>::value;
} // namespace internal
#line 12 "misc/fastio.hpp"
namespace fastio {
static constexpr int SZ = 1 << 17;
static constexpr int offset = 64;
char inbuf[SZ], outbuf[SZ];
int in_left = 0, in_right = 0, out_right = 0;
struct Pre {
char num[40000];
constexpr Pre() : num() {
for (int i = 0; i < 10000; i++) {
int n = i;
for (int j = 3; j >= 0; j--) {
num[i * 4 + j] = n % 10 + '0';
n /= 10;
}
}
}
} constexpr pre;
void load() {
int len = in_right - in_left;
memmove(inbuf, inbuf + in_left, len);
in_right = len + fread(inbuf + len, 1, SZ - len, stdin);
in_left = 0;
}
void flush() {
fwrite(outbuf, 1, out_right, stdout);
out_right = 0;
}
void skip_space() {
if (in_left + offset > in_right) load();
while (inbuf[in_left] <= ' ') in_left++;
}
void single_read(char& c) {
if (in_left + offset > in_right) load();
skip_space();
c = inbuf[in_left++];
}
void single_read(string& S) {
skip_space();
while (true) {
if (in_left == in_right) load();
int i = in_left;
for (; i != in_right; i++) {
if (inbuf[i] <= ' ') break;
}
copy(inbuf + in_left, inbuf + i, back_inserter(S));
in_left = i;
if (i != in_right) break;
}
}
template <typename T,
enable_if_t<internal::is_broadly_integral_v<T>>* = nullptr>
void single_read(T& x) {
if (in_left + offset > in_right) load();
skip_space();
char c = inbuf[in_left++];
[[maybe_unused]] bool minus = false;
if constexpr (internal::is_broadly_signed_v<T>) {
if (c == '-') minus = true, c = inbuf[in_left++];
}
x = 0;
while (c >= '0') {
x = x * 10 + (c & 15);
c = inbuf[in_left++];
}
if constexpr (internal::is_broadly_signed_v<T>) {
if (minus) x = -x;
}
}
void rd() {}
template <typename Head, typename... Tail>
void rd(Head& head, Tail&... tail) {
single_read(head);
rd(tail...);
}
void single_write(const char& c) {
if (out_right > SZ - offset) flush();
outbuf[out_right++] = c;
}
void single_write(const bool& b) {
if (out_right > SZ - offset) flush();
outbuf[out_right++] = b ? '1' : '0';
}
void single_write(const string& S) {
flush(), fwrite(S.data(), 1, S.size(), stdout);
}
void single_write(const char* p) { flush(), fwrite(p, 1, strlen(p), stdout); }
template <typename T,
enable_if_t<internal::is_broadly_integral_v<T>>* = nullptr>
void single_write(const T& _x) {
if (out_right > SZ - offset) flush();
if (_x == 0) {
outbuf[out_right++] = '0';
return;
}
T x = _x;
if constexpr (internal::is_broadly_signed_v<T>) {
if (x < 0) outbuf[out_right++] = '-', x = -x;
}
constexpr int buffer_size = sizeof(T) * 10 / 4;
char buf[buffer_size];
int i = buffer_size;
while (x >= 10000) {
i -= 4;
memcpy(buf + i, pre.num + (x % 10000) * 4, 4);
x /= 10000;
}
if (x < 100) {
if (x < 10) {
outbuf[out_right] = '0' + x;
++out_right;
} else {
uint32_t q = (uint32_t(x) * 205) >> 11;
uint32_t r = uint32_t(x) - q * 10;
outbuf[out_right] = '0' + q;
outbuf[out_right + 1] = '0' + r;
out_right += 2;
}
} else {
if (x < 1000) {
memcpy(outbuf + out_right, pre.num + (x << 2) + 1, 3);
out_right += 3;
} else {
memcpy(outbuf + out_right, pre.num + (x << 2), 4);
out_right += 4;
}
}
memcpy(outbuf + out_right, buf + i, buffer_size - i);
out_right += buffer_size - i;
}
void wt() {}
template <typename Head, typename... Tail>
void wt(const Head& head, const Tail&... tail) {
single_write(head);
wt(forward<const Tail>(tail)...);
}
template <typename... Args>
void wtn(const Args&... x) {
wt(forward<const Args>(x)...);
wt('\n');
}
struct Dummy {
Dummy() { atexit(flush); }
} dummy;
} // namespace fastio
using fastio::rd;
using fastio::skip_space;
using fastio::wt;
using fastio::wtn;
#line 2 "misc/rng.hpp"
#line 2 "internal/internal-seed.hpp"
#line 4 "internal/internal-seed.hpp"
using namespace std;
namespace internal {
unsigned long long non_deterministic_seed() {
unsigned long long m =
chrono::duration_cast<chrono::nanoseconds>(
chrono::high_resolution_clock::now().time_since_epoch())
.count();
m ^= 9845834732710364265uLL;
m ^= m << 24, m ^= m >> 31, m ^= m << 35;
return m;
}
unsigned long long deterministic_seed() { return 88172645463325252UL; }
// 64 bit の seed 値を生成 (手元では seed 固定)
// 連続で呼び出すと同じ値が何度も返ってくるので注意
// #define RANDOMIZED_SEED するとシードがランダムになる
unsigned long long seed() {
#if defined(NyaanLocal) && !defined(RANDOMIZED_SEED)
return deterministic_seed();
#else
return non_deterministic_seed();
#endif
}
} // namespace internal
#line 4 "misc/rng.hpp"
namespace my_rand {
using i64 = long long;
using u64 = unsigned long long;
// [0, 2^64 - 1)
u64 rng() {
static u64 _x = internal::seed();
return _x ^= _x << 7, _x ^= _x >> 9;
}
// [l, r]
i64 rng(i64 l, i64 r) {
assert(l <= r);
return l + rng() % u64(r - l + 1);
}
// [l, r)
i64 randint(i64 l, i64 r) {
assert(l < r);
return l + rng() % u64(r - l);
}
// choose n numbers from [l, r) without overlapping
vector<i64> randset(i64 l, i64 r, i64 n) {
assert(l <= r && n <= r - l);
unordered_set<i64> s;
for (i64 i = n; i; --i) {
i64 m = randint(l, r + 1 - i);
if (s.find(m) != s.end()) m = r - i;
s.insert(m);
}
vector<i64> ret;
for (auto& x : s) ret.push_back(x);
return ret;
}
// [0.0, 1.0)
double rnd() { return rng() * 5.42101086242752217004e-20; }
// [l, r)
double rnd(double l, double r) {
assert(l < r);
return l + rnd() * (r - l);
}
template <typename T>
void randshf(vector<T>& v) {
int n = v.size();
for (int i = 1; i < n; i++) swap(v[i], v[randint(0, i + 1)]);
}
} // namespace my_rand
using my_rand::randint;
using my_rand::randset;
using my_rand::randshf;
using my_rand::rnd;
using my_rand::rng;
#line 2 "misc/timer.hpp"
#line 4 "misc/timer.hpp"
using namespace std;
struct Timer {
chrono::high_resolution_clock::time_point st;
Timer() { reset(); }
void reset() { st = chrono::high_resolution_clock::now(); }
long long elapsed() {
auto ed = chrono::high_resolution_clock::now();
return chrono::duration_cast<chrono::milliseconds>(ed - st).count();
}
long long operator()() { return elapsed(); }
};
#line 8 "verify/verify-unit-test/radix-sort.test.cpp"
using namespace Nyaan;
template <typename T>
void test(int N) {
ll mx = numeric_limits<T>::max();
if (N <= 300) {
mx = pow(2.0, rnd() * log2(numeric_limits<T>::max()));
mx = clamp<T>(mx, 1, numeric_limits<T>::max());
}
Timer timer;
{
V<T> v(N);
each(x, v) x = rng(-mx, mx);
auto w = v;
timer.reset();
radix_sort(v);
ll t1 = timer.elapsed();
timer.reset();
sort(all(w));
ll t2 = timer.elapsed();
assert(v == w);
if (N >= TEN(8)) DebugImpl::trace("N", N, "radix", t1, "std", t2);
}
if (N <= 300) {
V<pair<T, T>> v(N);
each(x, v) {
x.fi = rng(-mx, mx);
x.se = rng(-mx, mx);
}
auto w = v;
radix_sort_compare_first(v);
stable_sort(all(w), [](const pair<T, T>& a, const pair<T, T>& b) {
return a.first < b.first;
});
if (v != w) {
trc2(v);
trc2(w);
}
assert(v == w);
}
}
void q() {
{
vector<int> v{2, 0, 1, -1, -2};
radix_sort(v);
vector<int> w{-2, -1, 0, 1, 2};
assert(v == w);
}
{
vector<int> v{2, 0, 2, -1, 1, 2, 0, -1, -2};
radix_sort(v);
vector<int> w{-2, -1, -1, 0, 0, 1, 2, 2, 2};
assert(v == w);
}
{
vector<ll> v{2, 0, 2, -1, 1, 2, 0, -1, -2};
radix_sort(v);
vector<ll> w{-2, -1, -1, 0, 0, 1, 2, 2, 2};
assert(v == w);
}
rep(N, 200) rep(t, 200) {
test<int>(N);
test<uint32_t>(N);
test<ll>(N);
}
rep(e, 6) {
test<int>(TEN(e));
test<uint32_t>(TEN(e));
test<ll>(TEN(e));
}
cerr << "OK" << endl;
/*
cerr << "OK" << endl;
rep(t, 3) test<int>(TEN(7));
rep(t, 3) test<ll>(TEN(7));
*/
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
void Nyaan::solve() {
int t = 1;
// in(t);
while (t--) q();
}
verify/verify-unit-test/radix-sort.test.cpp