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 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.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 given conditions. Hmm. The problem statement says that for each i from 0 to N, I have to determine s_i. The rules are a bit tricky, so I need to parse them carefully.
First, the definition of s_i. For e... |
[
{
"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 can make. Each jump is to a point that's diagonally adjacent, like (x±1, y±1).
Hmm, first, I need to figure out how to compute ... |
[
{
"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 seems a bit complex, so I should break it down step by step.
First, the problem statement says that Alice starts by picking an index (aliceIndex) and takes the 1 there if it exists. T... |
[
{
"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, Alice and Bob each remove the minimum element from nums. But the order is important h... |
[
{
"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 an array of integers nums of length n.\nThe cost of an array is the value of its first element. For example, the cost of [1,2,3] is 1 while the c... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 2,
"temperature": 0.7
} | 2 | 170 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <think>
Okay, let's see. I need to find the minimum possible sum of the cost when dividing the array into three disjoint contiguous subarrays. The cost of each subarray is the first element of that subarray. So the problem is to split the array into three parts, each part is contiguous, and the sum of their first eleme... |
[{"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. A good partitio(...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 cells white b(...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 try to figure out how to solve this problem. So the task is to find the number(...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 contains exactly t(...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.
- Downloads last month
- 3