{"task": {"agent_timeout": 600, "task": "omnimath_2228", "verifier_timeout": 60, "instruction": "# Mathematical Problem\n\n20 players are playing in a Super Smash Bros. Melee tournament. They are ranked $1-20$, and player $n$ will always beat player $m$ if $n<m$. Out of all possible tournaments where each player plays 18 distinct other players exactly once, one is chosen uniformly at random. Find the expected number of pairs of players that win the same number of games.\n\n## Instructions\n\nSolve the mathematical problem above and write your final answer to `/workspace/answer.txt`.\n\n**Important**: Write only your final answer to the file, not the full solution process.\n\n### Guidelines\n\n- Provide your final numerical answer or mathematical expression\n- Write the answer as plain text (no special formatting needed)\n- Be precise and clear in your answer\n- The answer should directly respond to what the problem asks for\n\n### Example\n\nIf the problem asks \"What is 2 + 2?\", your answer file should contain:\n\n```\n4\n```\n\nYour answer will be evaluated against the correct solution using an automated grading system.\n", "memory": "", "runnable": false, "difficulty": "hard", "language": "", "cpus": "", "instruction_truncated": false, "category": "math", "compose": false, "has_solution": true, "oracle": null, "docker_image": "", "taskset": "omnimath", "tags": ["omni-math"]}, "runs": []}