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.93k 259k |
|---|---|---|---|---|---|---|
[
{
"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, I need to solve this problem where given a positive integer N, I have to generate a string of length N+1. The string is built based on some conditions involving divisors of N. Let me try to understand the problem step by step.
First, the problem says that for each index i from 0 to N, I need to determine... |
[
{
"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, so I need to solve this problem where I have to calculate the sum of the minimum jumps required for every pair of points to move from one to another. The rabbit can jump in four possible directions each time: right-up, right-down, left-up, left-down. Wait, actually, the problem says the rabbit can jump to... |
[{"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> Okay, let's see. I need to find the minimum number of moves Alice needs to pick exactly k o(...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> Okay, so I need to solve this problem where Alice and Bob are playing a game with an array (...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> Okay, so I need to find the minimum possible sum of the costs when dividing the array into (...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> Okay, so I need to find the number of good partitions of the array nums. A good partition i(...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> Okay, so I need to solve this problem where I have to find the minimum number of operations(...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> Okay, so I need to figure out how to generate a Python function that calculates 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> Okay, let's see. I need to find the maximum sum of squares by choosing k elements from the (...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> Okay, I need to solve this problem where I have to remove the part between two | symbols in(...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