func_code_string: #include <bits/stdc++.h>   using namespace std;   long long const M = 2e5 + 10, M2 = 1e7 + 10, mod = 1e9 + 7, inf = 1e9 + 10,                   sq = 450;   long long a[M], cnt[M], t1, t2, t0, x1;   pair<long long, long long> good, ans;   bool check(long long ind, long long sum) {     if (sum - ind > x1) return 0;     long long res = t2 * ind + t1 * (sum - ind);     if (res >= sum * t0) return 1;     return 0;   }   int32_t main() {     long long x2;     cin >> t1 >> t2 >> x1 >> x2 >> t0;     bool flag = 0;     good = make_pair(-1, -1);     if (t1 > t2) swap(t1, t2), swap(x1, x2), flag = 1;     for (long long i = 1; i <= x1 + x2; i++) {       long long lo = 0, hi = min(x2, i);       if (!check(hi, i)) continue;       while (hi > lo + 1) {         long long mid = (lo + hi) / 2;         if (check(mid, i))           hi = mid;         else           lo = mid + 1;       }       long long best = hi;       if (check(lo, i)) best = lo;       long long res = best * t2 + t1 * (i - best);       if (good.first == -1 || (res * good.second <= good.first * i))         good = make_pair(res, i), ans = make_pair(best, i - best);     }     swap(ans.first, ans.second);     if (flag)       cout << ans.second <<     << ans.first;     else       cout << ans.first <<     << ans.second;   }   