This documentation is automatically generated by competitive-verifier/competitive-verifier
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/many_aplusb
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using i128 = __int128_t;
#include "../../src/misc/i128out.hpp"
#include "../../src/misc/read.hpp"
void solve() {
ll a = read(), b = read();
cout << i128(a + b) << "\n";
}
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int tt = read();
while (tt--) {
solve();
}
return 0;
}
#line 1 "test/misc/i128out.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/many_aplusb
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using i128 = __int128_t;
#line 1 "src/misc/i128out.hpp"
ostream& operator<<(ostream& out, i128 x) {
if (x == 0) return out.put('0');
if (x < 0) out.put('-'), x = -x;
static char buf[40];
int ptr = 40;
while (x) buf[--ptr] = '0' + x % 10, x /= 10;
return out.write(buf + ptr, 40 - ptr);
}
#line 1 "src/misc/read.hpp"
#define GC ch = getchar_unlocked()
ll read() {
ll x = 0, f = 1, GC;
while (ch < '0' || ch > '9') ch == '-' ? f = -1, GC : GC;
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', GC;
return x * f;
}
#undef GC
#line 9 "test/misc/i128out.test.cpp"
void solve() {
ll a = read(), b = read();
cout << i128(a + b) << "\n";
}
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int tt = read();
while (tt--) {
solve();
}
return 0;
}
| Env | Name | Status | Elapsed | Memory |
|---|---|---|---|---|
| g++ | all_max_00 |
|
263 ms | 4 MB |
| g++ | all_zero_00 |
|
39 ms | 4 MB |
| g++ | digit_random_00 |
|
177 ms | 4 MB |
| g++ | digit_random_01 |
|
173 ms | 4 MB |
| g++ | example_00 |
|
5 ms | 4 MB |
| g++ | max_random_00 |
|
264 ms | 4 MB |
| g++ | max_random_01 |
|
274 ms | 4 MB |
| g++ | random_00 |
|
113 ms | 4 MB |
| g++ | random_01 |
|
125 ms | 4 MB |