-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathABC217B.cpp
More file actions
42 lines (39 loc) · 1.33 KB
/
Copy pathABC217B.cpp
File metadata and controls
42 lines (39 loc) · 1.33 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#include <bits/stdc++.h>
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define RANGE_CIN(a) for (auto& x : a) std::cin >> x;
#define CHMAX(x,y) x = std::max(x,y)
#define CHMIN(x,y) x = std::min(x,y)
#define UNIQUE_ERASE(v) v.erase(std::unique(ALL(v)), v.end());
#define F_DIG_NUM(a) std::fixed << std::setprecision(a)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i,n) for(ll i = (ll)(n); i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define EB(x) emplace_back(x)
#define EM(x) emplace(x)
#define PSORT(v, fs) std::sort(ALL(v), [](const auto& a, const auto& b) { return a.fs < b.fs; })
#define PRSORT(v, fs) std::sort(RALL(v), [](const auto& a, const auto& b) { return a.fs < b.fs; })
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
std::vector<std::string> list = {
"ABC", "ARC", "AGC", "AHC"
};
std::sort(ALL(list));
std::vector<std::string> s(3);
RANGE_CIN(s);
std::sort(ALL(s));
REP(i, 3) {
if (s.at(i) != list.at(i)) {
std::cout << list.at(i) << std::endl;
return 0;
}
}
std::cout << list.at(3) << std::endl;
return 0;
}