問題：A - Maximize the Formula #include <algorithm> #include <iostream> using namespace std; #define REP(i, n) for (int i = 0; i < (n); ++i) int main(void){ int num[3]; cin.tie(0); ios::sync_with_stdio(false); cin >> num[0] >> num[1] >> num[2]; sort(num, num +</iostream></algorithm>…

問題：B - Shiritori #include <iostream> #include <set> #include <vector> using namespace std; #define REP(i, n) for (int i = 0; i < (n); ++i) int main(void){ int n; vector<string> v_w(100); set<string> s_w; bool flg = true; cin.tie(0); ios::sync_with_stdio(false); cin >> n; REP</string></string></vector></set></iostream>…