| 40 | } |
| 41 | |
| 42 | void solve() |
| 43 | { |
| 44 | int x = 1000000; |
| 45 | vector<ll int> vec(x + 1, -1); |
| 46 | vec[0] = vec[1] = 1; |
| 47 | for (int i = 1; i < x; i++) |
| 48 | { |
| 49 | vec[i + 1] = collatz(i + 1, vec, x - 1); |
| 50 | } |
| 51 | ll int maxm = -1, ans = -1; |
| 52 | for (int i = 0; i < vec.size(); i++) |
| 53 | { |
| 54 | if (vec[i] >= maxm) |
| 55 | { |
| 56 | maxm = vec[i]; |
| 57 | ans = i; |
| 58 | } |
| 59 | maxm = max(maxm, vec[i]); |
| 60 | } |
| 61 | cout << ans << endl; |
| 62 | return; |
| 63 | } |
| 64 | |
| 65 | int main() |
| 66 | { |