This documentation is automatically generated by online-judge-tools/verification-helper
#define PROBLEM "https://judge.yosupo.jp/problem/many_aplusb_128bit"
#include "../../template.h"
#include "../int128.h"
void solve() {
int ntest; cin >> ntest;
while (ntest--) {
i128 a, b; cin >> a >> b;
cout << a+b << '\n';
}
}
#line 1 "Misc/tests/yosupo_int128.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/many_aplusb_128bit"
#line 1 "template.h"
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
// For printing pair, container, etc.
// Copied from https://quangloc99.github.io/2021/07/30/my-CP-debugging-template.html
template<class U, class V> ostream& operator << (ostream& out, const pair<U, V>& p) {
return out << '(' << p.first << ", " << p.second << ')';
}
template<class Con, class = decltype(begin(declval<Con>()))>
typename enable_if<!is_same<Con, string>::value, ostream&>::type
operator << (ostream& out, const Con& con) {
out << '{';
for (auto beg = con.begin(), it = beg; it != con.end(); it++) {
out << (it == beg ? "" : ", ") << *it;
}
return out << '}';
}
template<size_t i, class T> ostream& print_tuple_utils(ostream& out, const T& tup) {
if constexpr(i == tuple_size<T>::value) return out << ")";
else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup);
}
template<class ...U> ostream& operator << (ostream& out, const tuple<U...>& t) {
return print_tuple_utils<0, tuple<U...>>(out, t);
}
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
long long get_rand(long long r) {
return uniform_int_distribution<long long> (0, r-1)(rng);
}
template<typename T>
vector<T> read_vector(int n) {
vector<T> res(n);
for (int& x : res) cin >> x;
return res;
}
void solve();
int main() {
ios::sync_with_stdio(0); cin.tie(0);
solve();
return 0;
}
#line 1 "Misc/int128.h"
// i128 helper functions {{{
using i128 = __int128_t;
i128 str2i128(std::string str) {
i128 ret = 0;
bool minus = false;
for (auto c : str) {
if (c == '-')
minus = true;
else
ret = ret * 10 + c - '0';
}
return minus ? -ret : ret;
}
std::istream &operator>>(std::istream &is, i128 &x) {
std::string s;
return is >> s, x = str2i128(s), is;
}
std::ostream &operator<<(std::ostream &os, const i128 &x) {
i128 tmp = x;
if (tmp == 0) return os << 0;
std::vector<int> ds;
if (tmp < 0) {
os << '-';
while (tmp) {
int d = tmp % 10;
if (d > 0) d -= 10;
ds.emplace_back(-d), tmp = (tmp - d) / 10;
}
} else {
while (tmp) ds.emplace_back(tmp % 10), tmp /= 10;
}
std::reverse(ds.begin(), ds.end());
for (auto i : ds) os << i;
return os;
}
i128 my_abs(i128 n) {
if (n < 0) return -n;
return n;
}
i128 gcd(i128 a, i128 b) {
if (b == 0) return a;
return gcd(b, a % b);
}
// Count trailing zeroes
int ctz128(i128 n) {
if (!n) return 128;
if (!static_cast<uint64_t>(n)) {
return __builtin_ctzll(static_cast<uint64_t>(n >> 64)) + 64;
} else {
return __builtin_ctzll(static_cast<uint64_t>(n));
}
}
// }}}
#line 5 "Misc/tests/yosupo_int128.test.cpp"
void solve() {
int ntest; cin >> ntest;
while (ntest--) {
i128 a, b; cin >> a >> b;
cout << a+b << '\n';
}
}