This documentation is automatically generated by competitive-verifier/competitive-verifier
#define PROBLEM "https://judge.yosupo.jp/problem/many_aplusb"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T>
T plus(T a, T b) {
return a + b;
}
int main() {
cin.tie(nullptr); ios::sync_with_stdio(false);
int T; cin >> T;
for (int t = 0; t < T; t++) {
ll A,B; cin>>A>>B;
cout << ::plus(A,B) << endl;
}
return 0;
}
#line 1 "test/standalone/manyplus.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/many_aplusb"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T>
T plus(T a, T b) {
return a + b;
}
int main() {
cin.tie(nullptr); ios::sync_with_stdio(false);
int T; cin >> T;
for (int t = 0; t < T; t++) {
ll A,B; cin>>A>>B;
cout << ::plus(A,B) << endl;
}
return 0;
}
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | all_max_00 |
![]() |
1163 ms | 3 MB |
g++ | all_zero_00 |
![]() |
886 ms | 3 MB |
g++ | digit_random_00 |
![]() |
1010 ms | 3 MB |
g++ | digit_random_01 |
![]() |
1006 ms | 3 MB |
g++ | example_00 |
![]() |
6 ms | 3 MB |
g++ | max_random_00 |
![]() |
1121 ms | 3 MB |
g++ | max_random_01 |
![]() |
1095 ms | 3 MB |
g++ | random_00 |
![]() |
423 ms | 3 MB |
g++ | random_01 |
![]() |
505 ms | 3 MB |
clang++ | all_max_00 |
![]() |
1115 ms | 3 MB |
clang++ | all_zero_00 |
![]() |
842 ms | 3 MB |
clang++ | digit_random_00 |
![]() |
1053 ms | 3 MB |
clang++ | digit_random_01 |
![]() |
1034 ms | 3 MB |
clang++ | example_00 |
![]() |
6 ms | 3 MB |
clang++ | max_random_00 |
![]() |
1133 ms | 3 MB |
clang++ | max_random_01 |
![]() |
1171 ms | 3 MB |
clang++ | random_00 |
![]() |
462 ms | 3 MB |
clang++ | random_01 |
![]() |
525 ms | 3 MB |