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 3.11k 229k |
|---|---|---|---|---|---|---|
[
{
"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.There are three cards with letters $\\texttt{a}$, $\\texttt{b}$, $\\texttt{c}$ placed in a row in some order. You can ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 0 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to solve this problem where I have three cards in a row, each being a, b, c. The task is to determine if after at most one swap, the order becomes abc. So, the function should take the input string and check all possible swaps to see if any of them result in abc. If yes, ou... |
[
{
"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.Slavic is preparing a present for a friend's birthday. He has an array $a$ of $n$ digits and the present will be the p... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 1 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. The problem is about finding the maximum product after adding 1 to exactly one digit in the array. Hmm. So the input is an array of digits, and for each test case, we need to pick one digit to add 1 to, then compute the product of all digits (including that modified one) and find ... |
[
{
"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 strip of paper $s$ that is $n$ cells long. Each cell is either black or white. In an operation you can... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 2 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | <|begin_of_thought|>
Okay, let's see. I need to find the minimum number of operations to turn all the black cells in a string into white using k-length consecutive operations. Hmm. So each operation can flip a k-length consecutive segment to all white. The goal is to do this with the least number of steps possible.
F... |
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED) | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 3 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "<|begin_of_thought|>\n\nOkay, let's see. I need to solve this problem where I have to determine if (...TRUNCATED) |
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED) | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 4 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "<|begin_of_thought|>\n\nOkay, let's see. I need to find the minimum number of operations to make th(...TRUNCATED) |
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED) | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 5 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "<|begin_of_thought|>\n\nOkay, let's try to figure out this problem. So the problem is about Vanya a(...TRUNCATED) |
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED) | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 6 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "<|begin_of_thought|>\n\nOkay, let's try to understand this problem. So, the task is to find the max(...TRUNCATED) |
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED) | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 7 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "<|begin_of_thought|>\n\nOkay, let's see. I need to find the maximum sum of a non-empty subarray whe(...TRUNCATED) |
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED) | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 8 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "<|begin_of_thought|>\n\nOkay, let's try to understand this problem. So Yarik's music system uses 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": 0,
"temperature": 0.7
} | 0 | 9 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "<|begin_of_thought|>\n\nOkay, let's see. I need to write a Python function that counts how many pas(...TRUNCATED) |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 3