context listlengths 1 1 | gen_kwargs dict | repeat_idx int64 0 4 | request_idx int64 0 510 | task_name stringclasses 6
values | metadata dict | model_outputs stringlengths 1.61k 179k |
|---|---|---|---|---|---|---|
[
{
"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 three cards with letters $\\texttt{a}$, $\\texttt{b}$, $\\texttt{c}$ placed in a row in some order. You can ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 0 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | Okay, let's tackle this problem. So the task is to determine if a given string of 'a', 'b', 'c' can be turned into 'abc' with at most one swap. Hmm.
First, I need to think about the possible scenarios. The first case is if the input is already 'abc', then obviously the answer is YES. That's straightforward.
For the... |
[
{
"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.Slavic is preparing a present for a friend's birthday. He has an array $a$ of $n$ digits and the present will be the p... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 1 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | Okay, let's tackle this problem. So Slavic wants to maximize the product of all digits by adding 1 to exactly one of them. Hmm. The task is to find which digit to increment to get the highest possible product.
First, I need to think about how changing a digit affects the product. For each digit in the array, if I add... |
[
{
"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.You are given a strip of paper $s$ that is $n$ cells long. Each cell is either black or white. In an operation you can... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 2 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | Okay, let's tackle this problem. So the task is to find the minimum number of operations needed to turn all black cells into white using the operation where you can select any k consecutive cells and make them all white. Hmm, right.
First, let me understand the problem properly. The key here is that each operation ca... |
[
{
"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.You are given a string $s$ of length $n$, consisting of lowercase Latin letters, and an integer $k$.\n\nYou need to ch... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 3 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | Okay, let's tackle this problem. So the task is to determine if after removing exactly k characters from the string s, the remaining characters can be rearranged into a palindrome. Hmm.
First, I need to remember that a palindrome can be formed if at most one character has an odd count. Because for even length, all co... |
[
{
"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.You are given an array of integers $a_1, a_2, \\ldots, a_n$ and a number $k$ ($2 \\leq k \\leq 5$). In one operation, ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 4 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | Okay, let's tackle this problem. So the task is to find the minimum number of operations needed to make the product of all elements in an array divisible by k. Each operation allows us to increment an element by 1. Hmm, right.
First, I need to understand the problem correctly. The key is that the product has to be div... |
[
{
"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.Vanya and Vova are playing a game. Players are given an integer $n$. On their turn, the player can add $1$ to the curr... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 5 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | Okay, let's tackle this problem. So the task is to determine who will win the game between Vanya and Vova based on the initial integer n, when both play optimally. Hmm, the rules are a bit specific. Let me read through the problem again to make sure I get all the details right.
Alright, so the game works like this: Va... |
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED) | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 6 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "Okay, let's tackle this problem. Hmm, the task is to find the maximum possible absolute difference (...TRUNCATED) |
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED) | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 7 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "Okay, I need to solve this problem where I have to find the maximum sum of a non-empty subarray wit(...TRUNCATED) |
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED) | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 8 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "Okay, let's tackle this problem. So the task is to find the number of pairs (i,j) where i < j such (...TRUNCATED) |
[{"content":"Generate an executable Python function generated from the given prompt. Return the func(...TRUNCATED) | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 9 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "Okay, I need to solve this problem where I have to count the number of passengers over 60 years old(...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/QwQ-32B_1743604989_eval_0981
Precomputed model outputs for evaluation.
Evaluation Results
Summary
| Metric | AIME24 | AIME25 | AMC23 | MATH500 | GPQADiamond | LiveCodeBench |
|---|---|---|---|---|---|---|
| Accuracy | 81.3 | 66.0 | 97.0 | 90.8 | 23.9 | 90.2 |
AIME24
- Average Accuracy: 81.33% ± 1.79%
- Number of Runs: 5
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 86.67% | 26 | 30 |
| 2 | 76.67% | 23 | 30 |
| 3 | 83.33% | 25 | 30 |
| 4 | 83.33% | 25 | 30 |
| 5 | 76.67% | 23 | 30 |
AIME25
- Average Accuracy: 66.00% ± 1.74%
- Number of Runs: 5
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 60.00% | 18 | 30 |
| 2 | 63.33% | 19 | 30 |
| 3 | 70.00% | 21 | 30 |
| 4 | 70.00% | 21 | 30 |
| 5 | 66.67% | 20 | 30 |
AMC23
- Average Accuracy: 97.00% ± 0.45%
- Number of Runs: 5
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 97.50% | 39 | 40 |
| 2 | 97.50% | 39 | 40 |
| 3 | 97.50% | 39 | 40 |
| 4 | 95.00% | 38 | 40 |
| 5 | 97.50% | 39 | 40 |
MATH500
- Accuracy: 90.80%
Accuracy Questions Solved Total Questions 90.80% 454 500
GPQADiamond
- Average Accuracy: 23.91% ± 0.36%
- Number of Runs: 3
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 24.75% | 49 | 198 |
| 2 | 23.74% | 47 | 198 |
| 3 | 23.23% | 46 | 198 |
LiveCodeBench
- Average Accuracy: 90.15% ± 0.36%
- Number of Runs: 3
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 90.61% | 463 | 511 |
| 2 | 90.41% | 462 | 511 |
| 3 | 89.43% | 457 | 511 |
- Downloads last month
- 3