data_source stringclasses 1 value | prompt listlengths 1 1 | ability stringclasses 1 value | reward_model null | extra_info dict |
|---|---|---|---|---|
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 293645085,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 293476357,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 283786369,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 299705611,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 299698651,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 283431031,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 283829234,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 283528155,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 283214477,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 284304681,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 285646798,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 285642442,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 284683338,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 284683097,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 283242946,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 289109919,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 296972726,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 283240800,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 284359993,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Speedbreaker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [Djjaner - Speedbreaker](https://soundcloud.com/luciano- ferrari-151560131/speedbreaker)\n... | TestCase-Eval | null | {
"problem_id": "2018B",
"submission_id": 283432721,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 257627342,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 257625062,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 266128732,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 257590068,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 257588341,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 257756854,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 285043530,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 257591137,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 258941214,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 257579548,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 276393056,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 257582846,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 257583377,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 257623842,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 271930652,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 257698641,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 257763898,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 260198046,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 268642057,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Stickogon\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given $$$n$$$ sticks of lengths $$$a_1, a_2, \\ldots, a_n$$$. Find the maximum number... | TestCase-Eval | null | {
"problem_id": "1957A",
"submission_id": 258311475,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 290826791,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 286824745,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 296265658,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 291479591,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 290476883,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 287989060,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 286822719,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 286812254,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 286898276,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 291308983,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 286823427,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 286817042,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 286804043,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 286801842,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 286794862,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 296368984,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 286831492,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 286810931,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 290458678,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Orangutan Approved Subarrays\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Suppose you have an array $b$. Initially, you also have a set $S$ that con... | TestCase-Eval | null | {
"problem_id": "2030F",
"submission_id": 286984514,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 298735098,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 303962947,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 293228948,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 304392350,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 304594167,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 304460734,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 304625645,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 304464864,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 293457772,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 293596742,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 293934003,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 298745823,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 293382069,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 294980620,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 295749476,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 293417347,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 296500257,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 293618826,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 305012512,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Drunken Maze\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nYou are given a two-dimensional maze with a start and e... | TestCase-Eval | null | {
"problem_id": "2041D",
"submission_id": 307170823,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 262147874,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 260815887,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 280854299,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 270595647,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 260529972,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 260529741,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 271772094,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 260601936,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 271769124,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 279315874,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 271013882,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 271691440,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 260917813,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 260917496,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 274616391,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 268785701,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 271693562,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 261059955,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 268751805,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Trails (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Harry Potter is hiking in the Alps surrounding Lake Geneva. In this area there are $$$m$$... | TestCase-Eval | null | {
"problem_id": "1970E3",
"submission_id": 268743187,
"task_type": "TestCase-Eval-Task2"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.