Dataset Viewer
Auto-converted to Parquet Duplicate
context
listlengths
1
1
gen_kwargs
dict
repeat_idx
int64
0
2
request_idx
int64
0
510
task_name
stringclasses
1 value
metadata
dict
model_outputs
stringlengths
2.16k
214k
[ { "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 positive integer N. Print a string of length (N+1), s_0s_1\\ldots s_N, defined as follows.\n\nFor each...
{ "do_sample": false, "max_new_tokens": 32768, "seed": 2, "temperature": 0.7 }
2
275
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
<think> Okay, let's see. I need to write a Python function that takes an integer N and outputs a string based on the rules given. Hmm. The problem statement says that for each position i in the string (from 0 to N), we have to check if there's a divisor j of N (between 1 and 9) such that i is a multiple of N/j. Then, a...
[ { "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.On a coordinate plane, there are N points P_1, P_2, \\ldots, P_N, where point P_i has coordinates (X_i, Y_i).\nThe dis...
{ "do_sample": false, "max_new_tokens": 32768, "seed": 1, "temperature": 0.7 }
1
433
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
<think> Okay, let's see. I need to calculate the sum of the distances between all pairs of points based on this specific jump definition. The distance is the minimum number of jumps required, and if impossible, it's zero. Hmm. First, I need to understand how the distance is calculated. The rabbit can jump in four dire...
[ { "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 binary array nums of length n, a positive integer k and a non-negative integer maxChanges.\nAlice plays a game, where the goal is for Alice to ...
{ "do_sample": false, "max_new_tokens": 32768, "seed": 1, "temperature": 0.7 }
1
464
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
<think> Okay, let's see. I need to find the minimum number of moves Alice needs to pick exactly k ones from the array. Hmm. The problem is a bit complex, so I need to break it down. First, the initial step is that Alice picks up a 1 at her starting position. So that counts as the first move, and she uses one of the k....
[ { "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 of even length and there is also an empty array arr. Alice and Bob decided to play a game where in every round Ali...
{ "do_sample": false, "max_new_tokens": 32768, "seed": 2, "temperature": 0.7 }
2
148
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
<think> Okay, let's see. I need to write a Python function that takes an array nums and returns the array arr based on the game rules between Alice and Bob. Hmm. Let's break down the problem. So, the game works in rounds. Each round has two steps. First, Alice removes the minimum element from nums. Then Bob does the s...
[{"content":"Generate an executable Python function generated from the given prompt. Return the func(...TRUNCATED)
{ "do_sample": false, "max_new_tokens": 32768, "seed": 2, "temperature": 0.7 }
2
170
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think>\nOkay, let's see. I need to write a Python function that takes an array of integers and div(...TRUNCATED)
[{"content":"Generate an executable Python function generated from the given prompt. Return the func(...TRUNCATED)
{ "do_sample": false, "max_new_tokens": 32768, "seed": 1, "temperature": 0.7 }
1
140
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think>\nOkay, let's see. I need to find the number of good partitions of an array where no two sub(...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
2
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think>\nOkay, let's see. I need to find the minimum number of operations to turn all black cells i(...TRUNCATED)
[{"content":"Generate an executable Python function generated from the given prompt. Return the func(...TRUNCATED)
{ "do_sample": false, "max_new_tokens": 32768, "seed": 2, "temperature": 0.7 }
2
503
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think>\nOkay, let's see. I need to write a Python function that calculates the number of ways Alic(...TRUNCATED)
[{"content":"Generate an executable Python function generated from the given prompt. Return the func(...TRUNCATED)
{ "do_sample": false, "max_new_tokens": 32768, "seed": 1, "temperature": 0.7 }
1
114
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think>\nOkay, let's see. I need to find the maximum sum of squares of k elements after performing (...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
401
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think>\nOkay, I need to solve this problem where I have to take a string S that has exactly two '|(...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/nemnano_100k_ckpt-305_eval_27e9

Precomputed model outputs for evaluation.

Evaluation Results

LiveCodeBench

  • Average Accuracy: 38.29% ± 1.25%
  • Number of Runs: 3
Run Accuracy Questions Solved Total Questions
1 36.01% 184 511
2 40.31% 206 511
3 38.55% 197 511
Downloads last month
3