問題：A - Right Triangle #include <algorithm> #include <iostream> using namespace std; int main(void) { int n[3]; cin.tie(0); ios::sync_with_stdio(false); cin >> n[0] >> n[1] >> n[2]; sort(n, n + 3); cout << (n[0] * n[1]) / 2 << "\n"; return 0; }</iostream></algorithm>

問題：B - Christmas Eve Eve #include <algorithm> #include <iostream> using namespace std; #define REP(i, n) for (int i = 0; i < (n); ++i) int main(void) { int n, p, max_p = 0, sum = 0; cin.tie(0); ios::sync_with_stdio(false); cin >> n; REP(i, n) { cin >> p; ma</iostream></algorithm>…

問題：A - Christmas Eve Eve Eve #include <iostream> using namespace std; #define REP(i, n) for (int i = 0; i < (n); ++i) int main(void) { int d; cin.tie(0); ios::sync_with_stdio(false); cin >> d; cout << "Christmas"; REP(i, 25 - d) { cout << " Eve";</iostream>…

問題：B - 754 #include <algorithm> #include <cstdlib> #include <iostream> #include <string> using namespace std; #define REP(i, n) for (int i = 0; i < (n); ++i) int main(void){ string s; int ans = 753; cin.tie(0); ios::sync_with_stdio(false); cin >> s; REP(i, s.length() - 2) {</string></iostream></cstdlib></algorithm>…