제출 #1172194

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1172194		nicolo_010	A + B (IOI24_aplusb)	C++20	100 / 100	0 ms	328 KiB

aplusb

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll  = long long;
using pii = pair<int, int>;
#define rep(i, k, n) for (int i = k; i < n; i++)
#define print(vec) for (auto x : vec) cout << x << " "; cout << "\n"
#define input(vec) for (int i = 0; i < vec.size(); i++) cin >> vec[i]
template<typename T>
using v = vector<T>;
template<typename T>
using pq = priority_queue<T, vector<T>, greater<T>>;
const int MOD = 1e9+7;

int sum(int a, int b) {
  return a+b;
}

• Subtask 0: 0 / 0
• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50