context listlengths 1 1 | gen_kwargs dict | repeat_idx int64 0 5 | request_idx int64 0 510 | task_name stringclasses 1
value | metadata dict | model_outputs stringlengths 2.46k 105k |
|---|---|---|---|---|---|---|
[
{
"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 and an integer k.\nReturn an integer that denotes the sum of elements in nums whose corresponding indices have exa... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 3,
"temperature": 0.7
} | 3 | 106 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | Okay, let's see. I need to write a Python function that sums the elements of an array where the index of each element has exactly k set bits in its binary representation. Hmm. So for each index, I have to check how many '1's are there in its binary form, and if that count equals k, add the element to the sum.
First, 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 two 0-indexed integer arrays nums1 and nums2 of even length n.\nYou must remove n / 2 elements from nums1 and n / 2 elements from nums2. After th... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 5,
"temperature": 0.7
} | 5 | 150 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | Okay, let's see. The problem is to find the maximum possible size of the set formed by the remaining elements after removing n/2 elements from each of the two arrays. Hmm. So, the key here is to choose which elements to remove from each array so that the union of the remaining elements has as many distinct elements as ... |
[
{
"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.A repunit is an integer whose digits are all 1 in decimal representation. The repunits in ascending order are 1, 11, 1... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 5,
"temperature": 0.7
} | 5 | 348 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | Okay, let's see. The problem is to find the N-th smallest integer that can be expressed as the sum of exactly three repunits. Repunits are numbers like 1, 11, 111, etc. So the sum has to be three of these, possibly the same one.
First, I need to figure out all possible sums of three repunits and then list them in orde... |
[
{
"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 N integers A_1, A_2, \\dots, A_N.\r\nAlso, define B_i = A_i \\times A_{i+1}\\ (1 \\leq i \\leq N-1).\nPr... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 3,
"temperature": 0.7
} | 3 | 410 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | Okay, I need to write a Python function that reads input from stdin, processes it, and outputs the correct result. The problem is to take a list of N integers and compute the product of consecutive elements, then output those products separated by spaces.
Let me start by understanding the problem again. The input is N... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are at a fruit market with different types of exotic fruits on display.\nYou are given a 1-indexed array prices, where prices[i] denotes the number of coin... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 3,
"temperature": 0.7
} | 3 | 137 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | Okay, let's see. The problem is about finding the minimum coins needed to buy all the fruits given a certain offer. The offer is, if you purchase the i-th fruit (1-indexed), you get the next i fruits for free. But even if you can take some fruits for free, buying them might give a better deal. Hmm.
So, the challenge i... |
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED) | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 3,
"temperature": 0.7
} | 3 | 320 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "Okay, let's tackle this problem. So, the task is to find the maximum possible rating Takahashi can (...TRUNCATED) |
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED) | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 4,
"temperature": 0.7
} | 4 | 359 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "Okay, I need to solve this programming problem. Let's read the problem statement carefully.\n\nSo, (...TRUNCATED) |
[{"content":"Generate an executable Python function generated from the given prompt. The function sh(...TRUNCATED) | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 1,
"temperature": 0.7
} | 1 | 260 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "Okay, let's see. I need to solve this programming problem. Hmm. The problem says that for each colo(...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 | 268 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "Okay, let's see. The problem is about finding the order in which we need to read books to be able t(...TRUNCATED) |
[{"content":"Generate an executable Python function generated from the given prompt. Return the func(...TRUNCATED) | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 5,
"temperature": 0.7
} | 5 | 83 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": ""
} | "Okay, let's see. The problem is to calculate the account balance after making a purchase where the (...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.
chengfu0118/DeepSeek-R1_1757155924_eval_27e9
Precomputed model outputs for evaluation.
Evaluation Results
LiveCodeBench
- Average Accuracy: 73.91% ± 3.47%
- Number of Runs: 6
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 77.30% | 395 | 511 |
| 2 | 77.50% | 396 | 511 |
| 3 | 77.89% | 398 | 511 |
| 4 | 76.71% | 392 | 511 |
| 5 | 56.56% | 289 | 511 |
| 6 | 77.50% | 396 | 511 |
- Downloads last month
- 5