Dataset Viewer
Auto-converted to Parquet Duplicate
context
listlengths
1
1
gen_kwargs
dict
repeat_idx
int64
0
5
request_idx
int64
0
510
task_name
stringclasses
1 value
metadata
dict
model_outputs
stringlengths
2.59k
254k
[ { "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 integer array nums and an integer k.\nReturn an integer that denotes the sum of elements in nums whose corresponding indices have exa...
{ "do_sample": false, "max_new_tokens": 32768, "seed": 3, "temperature": 0.7 }
3
106
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
<think> Okay, so I need to create a Python function that takes a list of integers nums and an integer k, and returns the sum of elements in nums where the indices have exactly k set bits in their binary representations. Hmm, let's think about how to approach this. First, the problem says to consider the indices of the...
[ { "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 two 0-indexed integer arrays nums1 and nums2 of even length n.\nYou must remove n / 2 elements from nums1 and n / 2 elements from nums2. After th...
{ "do_sample": false, "max_new_tokens": 32768, "seed": 5, "temperature": 0.7 }
5
150
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
<think> Okay, I need to solve this problem where I have to find the maximum possible size of a set formed by the remaining elements after removing exactly n/2 elements from each of the two arrays. Let me think about how to approach this. Hmm, the problem says we can remove n/2 elements from each array and then take th...
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED)
{ "do_sample": false, "max_new_tokens": 32768, "seed": 5, "temperature": 0.7 }
5
348
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think> Okay, I need to solve this problem where I have to find the N-th smallest integer that can (...TRUNCATED)
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED)
{ "do_sample": false, "max_new_tokens": 32768, "seed": 3, "temperature": 0.7 }
3
410
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think> Okay, so I need to write a Python function that takes input from standard input, processes (...TRUNCATED)
[{"content":"Generate an executable Python function generated from the given prompt. Return the func(...TRUNCATED)
{ "do_sample": false, "max_new_tokens": 32768, "seed": 3, "temperature": 0.7 }
3
137
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think> Okay, so I need to figure out how to solve this problem. Let me read through the problem st(...TRUNCATED)
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED)
{ "do_sample": false, "max_new_tokens": 32768, "seed": 3, "temperature": 0.7 }
3
320
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think> Okay, so I need to solve this problem where Takahashi wants to choose some contests to 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": 4, "temperature": 0.7 }
4
359
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think> Okay, I need to solve this problem where I have to place parts 1 to N²-1 on an N x N grid (...TRUNCATED)
[{"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
260
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think> Okay, let's see. I need to solve this problem where I have to process a string S based on s(...TRUNCATED)
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED)
{ "do_sample": false, "max_new_tokens": 32768, "seed": 2, "temperature": 0.7 }
2
268
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think> Okay, I need to solve this problem where I have to determine the order of books to read to (...TRUNCATED)
[{"content":"Generate an executable Python function generated from the given prompt. Return the func(...TRUNCATED)
{ "do_sample": false, "max_new_tokens": 32768, "seed": 5, "temperature": 0.7 }
5
83
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think> Okay, I need to solve this problem where I have to adjust the purchase amount to the neares(...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/ot3_300k_more_ckpts_step1000_eval_27e9

Precomputed model outputs for evaluation.

Evaluation Results

LiveCodeBench

  • Average Accuracy: 34.64% ± 0.87%
  • Number of Runs: 6
Run Accuracy Questions Solved Total Questions
1 33.86% 173 511
2 30.92% 158 511
3 36.79% 188 511
4 35.62% 182 511
5 34.44% 176 511
6 36.20% 185 511
Downloads last month
3