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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 297192464,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 295705392,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 299409459,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 307075584,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 302555126,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 295666920,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 295608655,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 295602919,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 303181065,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 295654008,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 295719332,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 296140150,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 301722922,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 301722457,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 295666294,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 295666505,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 295616811,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 296141596,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 296447861,
"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: Control of Randomness\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a tree with $$$n$$$ vertices.\n\nLet's place a robot in some vertex... | TestCase-Eval | null | {
"problem_id": "2040E",
"submission_id": 295980854,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 273986245,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 273432986,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 273882561,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 269166115,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 267415301,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 267645899,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 267874708,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 295388729,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 267381316,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 295347639,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 295167236,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 272721479,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 267428463,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 267352977,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 269132033,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 267634711,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 267401503,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 267394478,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 267508361,
"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: Sorting Problem Again\ntime_limit_ms: 2500\nmemory_limit_mb: 256\nDescription: You have an array $a$ of $n$ elements. There are also $q$ modifications of the ar... | TestCase-Eval | null | {
"problem_id": "1982F",
"submission_id": 294586406,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 283874798,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 267186167,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 267961302,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 267064636,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 267253920,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 267510098,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 267307851,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 267070772,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 296080828,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 267866658,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 267020114,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 267409711,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 267036824,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 267027539,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 267111182,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 267058383,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 268921098,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 268903860,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 269405830,
"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: Permutation Problem (Simple Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 128\nDescription: This is a simple version of the problem. The only difference is th... | TestCase-Eval | null | {
"problem_id": "1986G1",
"submission_id": 267067922,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 280637151,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 273226811,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 273365597,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 289903346,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 287420029,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 287410975,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 274661315,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 274664824,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 282859721,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 273372966,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 279013614,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 279009777,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 288690684,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 273721134,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 278767959,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 273206926,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 273721482,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 273720350,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 274665444,
"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: Prime Split Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game with $n$ piles of stones, where the $i$-th pile has $... | TestCase-Eval | null | {
"problem_id": "1991H",
"submission_id": 273227580,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 273212312,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 273223104,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 273204758,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 273207727,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 273212325,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 273212415,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 283800544,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 283772661,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 273335972,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 273245182,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 293701273,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 273178662,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 274054049,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 273274508,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 273245870,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 273215298,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 273177919,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 273209487,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 273208373,
"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: Coloring Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nConsider an undirected connected graph consisting of $... | TestCase-Eval | null | {
"problem_id": "1991E",
"submission_id": 273212192,
"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.