{"status": "success", "data": {"description_md": "**POTD January 13, 2023**\nConsider a graph with the following properties:\n1) Every pair of vertices has a path between them with at most $2024$ edges.\n2) Every pair of vertices has a path between them with an even number of edges (you can visit the same vertex and travel across the same edge multiple times).\n\nFind the smallest $k$ such that every pair of vertices has a path with an even number of edges which is at most $k$.", "description_html": "<p><strong>POTD January 13, 2023</strong><br/>&#10;Consider a graph with the following properties:</p>&#10;<ol>&#10;<li>Every pair of vertices has a path between them with at most <span class=\"katex--inline\">2024</span> edges.</li>&#10;<li>Every pair of vertices has a path between them with an even number of edges (you can visit the same vertex and travel across the same edge multiple times).</li>&#10;</ol>&#10;<p>Find the smallest <span class=\"katex--inline\">k</span> such that every pair of vertices has a path with an even number of edges which is at most <span class=\"katex--inline\">k</span>.</p>&#10;", "hints_md": "", "hints_html": "", "editorial_md": "", "editorial_html": "", "flag_hint": "", "point_value": 6, "problem_name": "Problem of the Day #39", "can_next": false, "can_prev": false, "nxt": "", "prev": ""}}