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
1.79k
185k
[ { "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 i from 0 to N, we need to determine s_i. So the main task is, for each i, find the smallest divisor j of N (between 1 and 9 inclusive) such th...
[ { "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 movement rule. The distance is the minimum number of jumps the rabbit makes, where each jump is moving diagonally one step in any of the four directions. Hmm. First, I should understand how the dist...
[{"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
464
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think>\nOkay, let's see. I need to find the minimum number of moves Alice needs to pick exactly k (...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
148
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think>\nOkay, let's see. I need to write a Python function that takes an array nums and returns th(...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
170
LiveCodeBench
{ "expected_answer": "", "problem_id": "", "reference_solution": "" }
"<think>\nOkay, let's see. I need to find the minimum possible sum of the cost when splitting the ar(...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 nums. A good par(...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 find the number of ways Alice can reach stair k. Hmm. The probl(...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-183_eval_27e9

Precomputed model outputs for evaluation.

Evaluation Results

LiveCodeBench

  • Average Accuracy: 33.72% ± 0.40%
  • Number of Runs: 3
Run Accuracy Questions Solved Total Questions
1 33.07% 169 511
2 33.66% 172 511
3 34.44% 176 511
Downloads last month
3