| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1317241 | foxserg | A + B (IOI24_aplusb) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
// #include <bits/extc++.h>
// #pragma GCC optimize("Ofast,unroll-loops,O3")
// #pragma GCC target("avx,avx2,fma")
using namespace std;
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
// template <typename T>
// using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
// template <typename T>
// using ordered_multiset = tree <T, null_type, less_equal <T>, rb_tree_tag, tree_order_statistics_node_update>;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using i128 = __int128_t;
istream& operator>>(istream& is, i128& x) {
long long a;
is >> a;
x = (i128) a;
return is;
}
ostream& operator<<(ostream& os, i128& x) {
long long a = (long long) x;
os << a;
return os;
}
template <typename T>
ostream& operator<<(ostream& is, vector <T>& a) {
for (uint i = 0; i < a.size(); ++i) is << a[i] << " ";
return is;
}
#ifdef LOCAL
# define DEBUG(x) cerr << "(" << __LINE__ << ") " << #x << ": " << x << endl;
#else
# define DEBUG(x)
#endif
const ll inf = 1e18 + 1e16;
const int inf_t = 1e9 + 7;
const ll mod = 1e9 + 7;
int sum(int a, int b) {
int c = 0;
if (a <= 10 && b <= 10) {
c = a + b;
}
return c;
}
signed main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int a, b;
cin >> a >> b;
}