Datasets:
id stringlengths 4 8 | question stringlengths 826 4.09k | question_title stringlengths 1 67 | platform stringclasses 2
values | difficulty stringclasses 3
values | contest_date stringdate 2024-08-03 00:00:00 2025-01-04 18:30:00 | starter_code stringlengths 0 172 | public_test_cases stringlengths 95 1.4k | private_test_cases stringlengths 112 92.8M | metadata stringlengths 2 45 |
|---|---|---|---|---|---|---|---|---|---|
abc365_b | You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Question: You are given an integer sequence A=(A_1,\ldots,A_N) of length N. Here, A_1, A_2, \ldots, A_N are all distinct.
Which element in A is the second largest?
Input... | Second Best | atcoder | easy | 2024-08-03T00:00:00 | [{"input": "4\n8 2 5 1\n", "output": "3\n", "testtype": "stdin"}, {"input": "8\n1 2 3 4 5 10 9 11\n", "output": "6\n", "testtype": "stdin"}] | eJztl72OXEUUhAmIeYbSxBbq06d/eRIkTIYDJ4slrwNkISGeAd6XquoLQjsgPHLKRquR5t4+X/2cnl++/P3Xr77w37cf+c93H29vn959eL59g1u+fkpUxOun2yvcfvzwfH1ezwfPb94/P//07o0+ev/8w9un28+v8LevRymvnyoSDR0DEwsbURCB4FMT0RAdMRATsRAbtaAGakXlixtqRx2oE3WhbmRBBpKPTGRDduRATuRCbrSCFmgVjW9saB1toE20hbbRC3qgV/RE54E6+kCf6At9YxSMwKgYidEweN6BMTEWxsYsmIFZMROzYXZM... | {} | |
abc365_a | You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests.
Question: You are given an integer Y between 1583 and 2023.
Find the number of days in the year Y of the Gregorian calendar.
Within the given range, the year Y has the fo... | Leap Year | atcoder | easy | 2024-08-03T00:00:00 | [{"input": "2023\n", "output": "365\n", "testtype": "stdin"}, {"input": "1992\n", "output": "366\n", "testtype": "stdin"}, {"input": "1800\n", "output": "365\n", "testtype": "stdin"}, {"input": "1600\n", "output": "366\n", "testtype": "stdin"}] | eJxrYJmaycQABhFJQEZ0tVJmXkFpiZKVgpKhqYVxTJ6SjoJSfmkJVMzYzBQiVJJaXFJSWZAKEiwuScnMU6rVUUDWbGFphqnZjEjNZhbmZNtsZGBgQLbNRgaG5DvbyMCIggAztTQlX7OliSUFUWVoQYHN2EIbt+bYKXoAEb63xA== | {} | |
abc365_e | "You will be given a question (problem specification) and will generate a correct Python program tha(...TRUNCATED) | Xor Sigma Problem | atcoder | hard | 2024-08-03T00:00:00 | "[{\"input\": \"3\\n1 3 2\\n\", \"output\": \"3\\n\", \"testtype\": \"stdin\"}, {\"input\": \"7\\n2 (...TRUNCATED) | "eJw03U2uLTFyHGAY0EIOegVVZP3R0EIE2IDGmgga2CNPvB6v0vEFb0tQ6/V7955TP2QyMzIi8v/+y7/9v3/99//2P/7PP/7jP//(...TRUNCATED) | {} | |
abc365_d | "You will be given a question (problem specification) and will generate a correct Python program tha(...TRUNCATED) | AtCoder Janken 3 | atcoder | medium | 2024-08-03T00:00:00 | "[{\"input\": \"6\\nPRSSRS\\n\", \"output\": \"5\\n\", \"testtype\": \"stdin\"}, {\"input\": \"10\\n(...TRUNCATED) | "eJxsvTFyZEvTJUdhVkFp7N8AaRRnFWl5FZqRG6AyRoGUqMz6ZlVDoCrcPS6633tA1a28kRHn+Mnv626g8N/+0//+P//3/+V/+j/(...TRUNCATED) | {} | |
abc365_c | "You will be given a question (problem specification) and will generate a correct Python program tha(...TRUNCATED) | Transportation Expenses | atcoder | medium | 2024-08-03T00:00:00 | "[{\"input\": \"4 8\\n1 3 2 4\\n\", \"output\": \"2\\n\", \"testtype\": \"stdin\"}, {\"input\": \"3 (...TRUNCATED) | "eJw03cutLb2SHGBAkA+aLlwLivVgFWWJAMmBnjR6II00kQXyTv4ovuD++3nuOXuvB4tMZkZGRP6f//zf/t///S//6b//73/927/(...TRUNCATED) | {} | |
3517 | "You will be given a question (problem specification) and will generate a correct Python program tha(...TRUNCATED) | shortest-distance-after-road-addition-queries-i | leetcode | medium | 2024-08-03T00:00:00 | "class Solution:\n def shortestDistanceAfterQueries(self, n: int, queries: List[List[int]]) -> Li(...TRUNCATED) | "[{\"input\": \"5\\n[[2, 4], [0, 2], [0, 4]]\", \"output\": \"[3, 2, 1]\", \"testtype\": \"functiona(...TRUNCATED) | "eJztveuu5kiSHKgF9CCF/k0IjAtvepIFUv1jsZgFBhBGAtTzY7EQoIfQe+0riW5mbk6ec7K6stU13Rol+jCK/SXJICPcPfxi7vH(...TRUNCATED) | {"func_name": "shortestDistanceAfterQueries"} |
3527 | "You will be given a question (problem specification) and will generate a correct Python program tha(...TRUNCATED) | alternating-groups-iii | leetcode | hard | 2024-08-03T00:00:00 | "class Solution:\n def numberOfAlternatingGroups(self, colors: List[int], queries: List[List[int](...TRUNCATED) | "[{\"input\": \"[0, 1, 1, 0, 1]\\n[[2, 1, 0], [1, 4]]\", \"output\": \"[2]\", \"testtype\": \"functi(...TRUNCATED) | "eJzsvdvKbU2OJeYLP0iS13kR50M/iSG7DMa0ocBkFziLxjQGv4Nf2Ir17RWSdkhjzl3Gd/Ej9r++teaMkIZGnCMU//f/+D/9t//(...TRUNCATED) | {"func_name": "numberOfAlternatingGroups"} |
3533 | "You will be given a question (problem specification) and will generate a correct Python program tha(...TRUNCATED) | snake-in-matrix | leetcode | easy | 2024-08-10T00:00:00 | class Solution:
def finalPositionOfSnake(self, n: int, commands: List[str]) -> int:
| "[{\"input\": \"2\\n[\\\"RIGHT\\\", \\\"DOWN\\\"]\", \"output\": \"3\", \"testtype\": \"functional\"(...TRUNCATED) | "eJztW9tqFEEQ9cEPCfMcJNlrVl+9gqiIopDNg0iEgGwCzj6ICH6Efo1vfpnZZTKX6qpTp3tmLyGTl+nt7a7Lqa7LVGd/3f/z79G(...TRUNCATED) | {"func_name": "finalPositionOfSnake"} |
3535 | "You will be given a question (problem specification) and will generate a correct Python program tha(...TRUNCATED) | find-the-count-of-monotonic-pairs-i | leetcode | hard | 2024-08-10T00:00:00 | class Solution:
def countOfPairs(self, nums: List[int]) -> int:
| "[{\"input\": \"[2, 3, 2]\", \"output\": \"4\", \"testtype\": \"functional\"}, {\"input\": \"[5, 5, (...TRUNCATED) | "eJztXduqJclxtcEf0sxzYSoi7/4QYxB6MEYGgZEMHj0YY/BH+P/8K94ZsVZk7tOSmSN5CnUrmZ1Tp/epyktcVqzIyszzX3/zD//(...TRUNCATED) | {"func_name": "countOfPairs"} |
3519 | "You will be given a question (problem specification) and will generate a correct Python program tha(...TRUNCATED) | find-the-number-of-winning-players | leetcode | easy | 2024-08-03T00:00:00 | class Solution:
def winningPlayerCount(self, n: int, pick: List[List[int]]) -> int:
| "[{\"input\": \"4\\n[[0, 0], [1, 0], [1, 0], [2, 1], [2, 1], [2, 0]]\", \"output\": \"2\", \"testtyp(...TRUNCATED) | "eJztWsuqJDcS9WI+pLjLITF6P/wlhnYuhsEGw9A2+PZiGAz+Aq/s/3WlFCfiKOuauVXVy65FqjJTCsX7pfztH3/++c+vxu/b369(...TRUNCATED) | {"func_name": "winningPlayerCount"} |
End of preview. Expand in Data Studio
zero-code L1 test set — LiveCodeBench v5, 2024-08-01 to 2025-02-01 (279 problems)
Held-out Test set for the zero_code L1 task (DeepCoder-style RL on DeepSeek-R1-Distill-Qwen-1.5B).
- Source:
livecodebench/code_generation_lite, release_v5 filestest.jsonl…test5.jsonlat revision0fe84c39, filtered tocontest_datein [2024-08-01, 2025-02-01). 279 problems: 67 easy / 89 medium / 123 hard; 175 AtCoder (stdin) / 104 LeetCode (functional). questionis the exact LiveCodeBench DeepSeek-R1 user prompt (no chat tokens); the final program must be in a ```python block.- Ground truth:
public_test_cases,private_test_cases(LCB encoding: JSON, or base64+zlib+pickle of JSON) andmetadata(func_name). - Scoring:
evaluator.py(LiveCodeBenchtesting_util, vendored; 6 s per test; all tests must pass) → pass@1.python3 evaluator.py PREDICTIONS_CSV SCORING_SET METRICS_JSON, predictions CSV columnsid,prediction.
- Downloads last month
- 41