{"status": "success", "data": {"description_md": "A set of $25$ square blocks is arranged into a $5 \\times 5$ square. How many different combinations of $3$ blocks can be selected from that set so that no two are in the same row or column?\n\n$\\textbf{(A) } 100 \\qquad\\textbf{(B) } 125 \\qquad\\textbf{(C) } 600 \\qquad\\textbf{(D) } 2300 \\qquad\\textbf{(E) } 3600$", "description_html": "<p>A set of  <span class=\"katex--inline\">25</span>  square blocks is arranged into a  <span class=\"katex--inline\">5 \\times 5</span>  square. How many different combinations of  <span class=\"katex--inline\">3</span>  blocks can be selected from that set so that no two are in the same row or column?</p>\n<p> <span class=\"katex--inline\">\\textbf{(A) } 100 \\qquad\\textbf{(B) } 125 \\qquad\\textbf{(C) } 600 \\qquad\\textbf{(D) } 2300 \\qquad\\textbf{(E) } 3600</span> </p>\n<hr><p>Full credit goes to <a href=\"https://maa.org/\">MAA</a> for authoring these problems. These problems were taken on the <a href=\"https://artofproblemsolving.com/\">AOPS</a> website.</p>", "hints_md": "", "hints_html": "", "editorial_md": "", "editorial_html": "", "flag_hint": "", "point_value": 3, "problem_name": "2007 AMC 10B Problem 20", "can_next": true, "can_prev": true, "nxt": "/problem/07_amc10B_p21", "prev": "/problem/07_amc10B_p19"}}