{"status": "success", "data": {"description_md": "Consider an array $\\mathcal{S}$, where $f(\\mathcal{S})$ represents the sum of all elements in it. Initially, $\\mathcal{S} = \\{1, 1\\}$. In each move, you can either add the last element of $\\mathcal{S}$ or $f(\\mathcal{S})$ to the back of $\\mathcal{S}$. Determine the minimum number of moves required to make $f(\\mathcal{S}) = 2024$.", "description_html": "<p>Consider an array <span class=\"katex--inline\">\\mathcal{S}</span>, where <span class=\"katex--inline\">f(\\mathcal{S})</span> represents the sum of all elements in it. Initially, <span class=\"katex--inline\">\\mathcal{S} = \\{1, 1\\}</span>. In each move, you can either add the last element of <span class=\"katex--inline\">\\mathcal{S}</span> or <span class=\"katex--inline\">f(\\mathcal{S})</span> to the back of <span class=\"katex--inline\">\\mathcal{S}</span>. Determine the minimum number of moves required to make <span class=\"katex--inline\">f(\\mathcal{S}) = 2024</span>.</p>&#10;", "hints_md": "", "hints_html": "", "editorial_md": "", "editorial_html": "", "flag_hint": "", "point_value": 5, "problem_name": "Holiday Contest 2025 - Team Round - Problem 15", "can_next": false, "can_prev": false, "nxt": "", "prev": ""}}