context listlengths 1 1 | gen_kwargs dict | repeat_idx int64 0 9 | request_idx int64 0 514 | task_name stringclasses 9
values | metadata dict | model_outputs stringlengths 1 510k |
|---|---|---|---|---|---|---|
[
{
"content": "Generate an executable Python function generated from the given prompt. The function should take stdin as input and print the output. Simply call the function after the definition.There are N competitive programmers numbered person 1, person 2, \\ldots, and person N.\nThere is a relation called su... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 256 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | <think>
Okay, I need to solve this problem where I have to find the strongest programmer among N people based on given M comparisons. The output is either the person's number or -1 if there's ambiguity. Let's think through how to approach this.
First, the problem states that the superiority is transitive. So if A is s... |
[
{
"content": "In this problem, the final will be a numeric value. Give the numerical answer correct upto the 2nd decimal digit. Give a detailed solution and end the solution with the final answer. Mark your solution with \\boxed\nAnswer:\n\nProblem: 2 mol of $\\mathrm{Hg}(g)$ is combusted in a fixed volume bomb... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 2,
"temperature": 0.7
} | 2 | 400 | JEEBench | {
"expected_answer": "90.39",
"problem_id": "37",
"reference_solution": null,
"subject": "chem",
"type": "Numeric"
} | To solve this problem, we need to determine the standard molar enthalpy of formation of HgO(s) at 298 K using the given data. The process involves a combustion reaction of Hg(g) in a bomb calorimeter, and we can use the principles of calorimetry and thermodynamics to find the solution.
### Step-by-Step Solution:
1. *... |
[
{
"content": "You are a coding expert. Given a competition-level coding problem, you need to write a Python program to solve it. You may start by outlining your thought process. In the end, please provide the complete code in a code block enclosed with ``` ```. The code should take stdin as input and print the ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 1,
"temperature": 0.7
} | 1 | 363 | CodeForces | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | To solve this problem, we need to determine the maximum number of points Kevin can earn by rearranging the given integers. The key insight is to recognize that the optimal strategy involves arranging the numbers such that as many even numbers as possible are placed early, allowing Kevin to earn points more efficiently.... |
[
{
"content": "Return your final response within \\boxed{} and only include the letter choice (A, B, C, or D) as your final response.\nProblem: How many of the stars listed below would be detectable using the ESPRESSO spectrograph, when it is coupled with one of the 8m VLT telescopes at the Paranal Observatory? ... | {
"do_sample": true,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 186 | GPQADiamond | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | To determine which stars are detectable using ESPRESSO with the VLT, we need to calculate the signal-to-noise ratio (S/N) for each star. The requirement is S/N ≥ 10 per binned pixel over a 1-hour exposure.
First, let's recall that the signal from a star is proportional to its luminosity, which depends on its absolute ... |
[
{
"content": "You are a coding expert. Given a competition-level coding problem, you need to write a Python program to solve it. You may start by outlining your thought process. In the end, please provide the complete code in a code block enclosed with ``` ```. The code should take stdin as input and print the ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 321 | CodeForces | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | To solve this problem, we need to track the possible positions of the joker after each operation on the deck. Each operation involves moving a card from a specific position to either the beginning or the end of the deck. The goal is to determine the number of distinct positions the joker can occupy after each operation... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed array of positive integers nums.\nA subarray of nums is called incremovable if nums becomes strictly increasing on removing the subar... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 2,
"temperature": 0.7
} | 2 | 167 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | To solve this problem, we need to determine the number of subarrays that can be removed from the given array such that the remaining array becomes strictly increasing. A strictly increasing array is one where each element is greater than the previous one.
### Approach
1. **Understanding the Problem**: An incremovable ... |
[
{
"content": "\"You are a coding expert. Given a competition-level coding problem, you need to write a Python program to solve it. You may start by outlining your thought process. In the end, please provide the complete code in a code block enclosed with ``` ```. The code should take stdin as input and print th... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 2,
"temperature": 0.7
} | 2 | 152 | CodeElo | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | To solve this problem, we need to determine the earliest moment when all lights in an apartment are turned on. Each room has a light that is controlled by a chip installed at a specific time, and the light toggles every \(k\) minutes. The challenge is to find the earliest time when all lights are on simultaneously or d... |
[
{
"content": "\"You are a coding expert. Given a competition-level coding problem, you need to write a Python program to solve it. You may start by outlining your thought process. In the end, please provide the complete code in a code block enclosed with ``` ```. The code should take stdin as input and print th... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 31 | CodeElo | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | To solve this problem, we need to determine after each query whether all black vertices in a tree form a chain. A chain is defined as a path between two black vertices that includes all black vertices in between.
### Approach
1. **Tree Representation**: Use a tree structure where each node is a vertex. The tree is bu... |
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED) | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 1,
"temperature": 0.7
} | 1 | 359 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | "To solve this problem, we need to place Takahashi and the dragon parts on a grid such that all the (...TRUNCATED) |
[{"content":"Problem: Rectangle $ABCD$ has center $O$ and $AB/AD=k$. A point is randomly chosen from(...TRUNCATED) | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 444 | MATH500 | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | "To solve the problem, we need to determine the probability that a randomly chosen point inside rect(...TRUNCATED) |
End of preview. Expand in Data Studio
YAML Metadata Warning:empty or missing yaml metadata in repo card
Check out the documentation for more information.
mlfoundations-dev/a1_code_rosetta_eval_636d
Precomputed model outputs for evaluation.
Evaluation Results
Summary
| Metric | AIME24 | AMC23 | MATH500 | MMLUPro | JEEBench | GPQADiamond | LiveCodeBench | CodeElo | CodeForces |
|---|---|---|---|---|---|---|---|---|---|
| Accuracy | 15.7 | 58.5 | 74.6 | 28.6 | 42.2 | 44.4 | 29.8 | 5.5 | 8.8 |
AIME24
- Average Accuracy: 15.67% ± 0.82%
- Number of Runs: 10
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 20.00% | 6 | 30 |
| 2 | 13.33% | 4 | 30 |
| 3 | 13.33% | 4 | 30 |
| 4 | 13.33% | 4 | 30 |
| 5 | 20.00% | 6 | 30 |
| 6 | 16.67% | 5 | 30 |
| 7 | 16.67% | 5 | 30 |
| 8 | 16.67% | 5 | 30 |
| 9 | 13.33% | 4 | 30 |
| 10 | 13.33% | 4 | 30 |
AMC23
- Average Accuracy: 58.50% ± 1.18%
- Number of Runs: 10
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 57.50% | 23 | 40 |
| 2 | 57.50% | 23 | 40 |
| 3 | 65.00% | 26 | 40 |
| 4 | 55.00% | 22 | 40 |
| 5 | 65.00% | 26 | 40 |
| 6 | 57.50% | 23 | 40 |
| 7 | 57.50% | 23 | 40 |
| 8 | 52.50% | 21 | 40 |
| 9 | 60.00% | 24 | 40 |
| 10 | 57.50% | 23 | 40 |
MATH500
- Accuracy: 74.60%
Accuracy Questions Solved Total Questions 74.60% 373 500
MMLUPro
- Average Accuracy: 28.60% ± 0.00%
- Number of Runs: 1
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 28.60% | 143 | 500 |
JEEBench
- Average Accuracy: 42.22% ± 0.95%
- Number of Runs: 3
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 42.04% | 216.5 | 515 |
| 2 | 44.32% | 228.25 | 515 |
| 3 | 40.29% | 207.5 | 515 |
GPQADiamond
- Average Accuracy: 44.44% ± 1.65%
- Number of Runs: 3
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 46.46% | 92 | 198 |
| 2 | 46.46% | 92 | 198 |
| 3 | 40.40% | 80 | 198 |
LiveCodeBench
- Average Accuracy: 29.81% ± 0.94%
- Number of Runs: 3
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 31.12% | 159 | 511 |
| 2 | 30.33% | 155 | 511 |
| 3 | 27.98% | 143 | 511 |
CodeElo
- Average Accuracy: 5.54% ± 0.23%
- Number of Runs: 3
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 5.63% | 22 | 391 |
| 2 | 5.88% | 23 | 391 |
| 3 | 5.12% | 20 | 391 |
CodeForces
- Average Accuracy: 8.83% ± 0.38%
- Number of Runs: 3
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 8.17% | 37 | 453 |
| 2 | 8.83% | 40 | 453 |
| 3 | 9.49% | 43 | 453 |
- Downloads last month
- 3