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 2.43k 136k |
|---|---|---|---|---|---|---|
[
{
"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 see. I need to write a Python function that checks if a given permutation of 'a', 'b', 'c' can be transformed into 'abc' with at most one swap. The function should take input from stdin, process each test case, and print "YES" or "NO" accordingly.
First, I need to understand the problem. We have three dist... |
[
{
"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 step by step. So, Slavic wants to maximize the product of an array of digits by adding 1 to exactly one of them. The challenge is to figure out which digit to increment to get the highest possible product.
First, I need to understand the problem thoroughly. The input consists of multip... |
[
{
"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 step by step. So, the goal is to find the minimum number of operations needed to turn all black cells (B) into white cells (W). Each operation allows us to turn any k consecutive cells into white.
First, I need to understand the problem thoroughly. Let's restate it: we have a string of... |
[
{
"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 step by step. So, the task is to determine if we can remove exactly k characters from a given string such that the remaining characters can form a palindrome. The input consists of multiple test cases, each with a string s of length n and an integer k.
First, I need to recall that a pa... |
[{"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 | 4 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "Okay, let's tackle this problem step by step. So, the goal is to find the minimum number of increme(...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 | 5 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "Okay, let's try to figure out this problem. So, Vanya and Vova are playing a game with an integer n(...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 | 6 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "Okay, let's tackle this problem step by step. So, the goal is to find, for each test case, the maxi(...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, let's tackle this problem step by step. So, Yarik wants the maximum sum of a non-empty subarr(...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 step by step. So, Yarik has these notes represented by integers of (...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, let's see. I need to write a Python function that takes a list of strings called `details` as(...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/Light-R1-32B_1743605083_eval_0981
Precomputed model outputs for evaluation.
Evaluation Results
Summary
| Metric | AIME24 | AIME25 | AMC23 | MATH500 | GPQADiamond | LiveCodeBench |
|---|---|---|---|---|---|---|
| Accuracy | 75.3 | 52.7 | 95.5 | 90.2 | 26.3 | 54.2 |
AIME24
- Average Accuracy: 75.33% ± 2.42%
- Number of Runs: 5
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 83.33% | 25 | 30 |
| 2 | 76.67% | 23 | 30 |
| 3 | 73.33% | 22 | 30 |
| 4 | 66.67% | 20 | 30 |
| 5 | 76.67% | 23 | 30 |
AIME25
- Average Accuracy: 52.67% ± 1.74%
- Number of Runs: 5
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 50.00% | 15 | 30 |
| 2 | 56.67% | 17 | 30 |
| 3 | 46.67% | 14 | 30 |
| 4 | 53.33% | 16 | 30 |
| 5 | 56.67% | 17 | 30 |
AMC23
- Average Accuracy: 95.50% ± 1.10%
- Number of Runs: 5
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 95.00% | 38 | 40 |
| 2 | 92.50% | 37 | 40 |
| 3 | 95.00% | 38 | 40 |
| 4 | 100.00% | 40 | 40 |
| 5 | 95.00% | 38 | 40 |
MATH500
- Accuracy: 90.20%
Accuracy Questions Solved Total Questions 90.20% 451 500
GPQADiamond
- Average Accuracy: 26.26% ± 1.24%
- Number of Runs: 3
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 24.75% | 49 | 198 |
| 2 | 24.75% | 49 | 198 |
| 3 | 29.29% | 58 | 198 |
LiveCodeBench
- Average Accuracy: 54.21% ± 0.41%
- Number of Runs: 3
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 54.40% | 278 | 511 |
| 2 | 54.79% | 280 | 511 |
| 3 | 53.42% | 273 | 511 |
- Downloads last month
- 3