The 2021 ICPC Asia Taipei Regional Programming Contest

待补：C.Community Service/D.Largest Remainder

A. Ice Cream

直接 O ( 1 ) O(1) O(1)计算即可。

#include 
#define int long long
using namespace std;

inline void solve(){
    int n, x, y; cin >> x >> y >> n;
    int by = (n / (x + y)) * x * 3 + (min(n % (x + y), x) * 3);
    cout  n;
    string s1, s2; cin >> s1 >> s2;
    int ans1 = 0, ans2 = 0, ansl = 0, ansr = 0;
    for(int i = 0; i