func_code_string: #include <bits/stdc++.h>   #pragma comment(linker,  /STACK:256000000 )   using namespace std;   long long mulmod(long long a, long long b, long long MOD) {     if (b == 0) return 0;     long long res = mulmod(a, b >> 1, MOD);     res += res;     res %= MOD;     return (b & 1) ? (a + res) % MOD : res;   }   int main() {     ios::sync_with_stdio(0);     long long t1, t2, x1, x2, t0;     cin >> t1 >> t2 >> x1 >> x2 >> t0;     long long ans1 = 3000000000000ll, ans2 = 1, ii = 0, jj = 0;     if (t1 == t0) {       if (t2 == t0) {         cout << x1 <<     << x2 << endl;         return 0;       } else {         cout << x1 <<     << 0 << endl;         return 0;       }     }     if (t2 == t0) {       cout << 0 <<     << x2 << endl;       return 0;     }     if (t0 <= t1) {       ii = x1;       jj = 0;       ans1 = x1 * t1;       ans2 = x1;     }     if (t0 <= t2 &&         (ans1 == 3000000000000ll || (t2 < t1 || (t2 == t1 && x2 > x1)))) {       ii = 0;       jj = x2;       ans1 = x2 * t2;       ans2 = x2;     }     for (long long i = 0; i <= x1; i++) {       long long j = (i * (t0 - t1)) / (t2 - t0);       if ((i * (t0 - t1)) % (t2 - t0) != 0) {         j++;       }       if (i == 0 && j == 0) continue;       if (j < 0 || j > x2) {         continue;       }       if (ans1 * (i + j) > (i * t1 + j * t2) * ans2) {         ans1 = (i * t1 + j * t2);         ans2 = (i + j);         ii = i;         jj = j;       } else {         if (ans1 * (i + j) == (i * t1 + j * t2) * ans2 && ans2 < (i + j)) {           ans1 = (i * t1 + j * t2);           ans2 = (i + j);           ii = i;           jj = j;         }       }     }     cout << ii <<     << jj << endl;     return 0;   }   