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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 273178266,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 273212939,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 279423488,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 273189865,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 273227754,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 273193126,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 273607061,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 273357973,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 278275499,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 290298848,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 273222230,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 273407729,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 285167489,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 274005000,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 274673969,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 273201875,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 273190780,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 273185699,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 298521848,
"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: Triangle Formation\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given $n$ sticks, numbered from $1$ to $n$. The length of the $i$-th stick i... | TestCase-Eval | null | {
"problem_id": "1991F",
"submission_id": 274006849,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 300369518,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 287016673,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 286935554,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 286925387,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 287128253,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 289775063,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 286930661,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 287001691,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 286919878,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 286924470,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 287386162,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 287195354,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 287087569,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 287084111,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 287015369,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 297706466,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 297737055,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 287905827,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 287013376,
"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: Buying Lemonade\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a vending machine that sells lemonade. The machine has a total of $n$ slots. Y... | TestCase-Eval | null | {
"problem_id": "2024B",
"submission_id": 287210651,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 261892092,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 277909759,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 265932109,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 262214686,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 294883076,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 262213975,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 262407787,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 262560805,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 261868169,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 272297347,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 262492334,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 294905652,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 262919769,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 262908650,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 261887942,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 261874533,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 262374547,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 262445001,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 286265666,
"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: Money Buys Less Happiness Now\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You can never buy enough happiness, so here we go again! In this version,... | TestCase-Eval | null | {
"problem_id": "1974G",
"submission_id": 286265190,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 289886082,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 289572440,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 293982050,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 289289414,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 290319501,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 298740006,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 292400501,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 293574507,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 289498150,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 291434543,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 289267440,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 290498529,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 289332460,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 290368512,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 300202677,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 292643015,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 289461391,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 289349529,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 289461770,
"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: Peanuts\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Having the magical beanstalk, Jack has been gathering a lot of peanuts lately. Eventually, he h... | TestCase-Eval | null | {
"problem_id": "2032F",
"submission_id": 290367906,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 294228636,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 294588261,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 305396435,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 295383752,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 295383862,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 294284480,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 300866227,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 294695056,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 294708126,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 294708803,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 295129440,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 294630570,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 302288128,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 302289633,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 296579629,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 294165862,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 302949038,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 298790311,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 304996030,
"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: Mirror Maze\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: You are given a grid of $$$R$$$ rows (numbered from $$$1$$$ to $$$R$$$ from north to south... | TestCase-Eval | null | {
"problem_id": "2045M",
"submission_id": 295341559,
"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.