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: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 255755332,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 257737005,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 255833107,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 255756768,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 297733807,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 255747907,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 255735561,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 255903758,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 286488544,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 281626133,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 258222064,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 255744405,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 301650339,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 255758769,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 255716825,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 256149759,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 255734905,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 255786813,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 255789383,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Unfair Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob gathered in the evening to play an exciting game on a sequence of $$$n$$$ int... | TestCase-Eval | null | {
"problem_id": "1955F",
"submission_id": 255727636,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 283179442,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 282234256,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 282237541,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 282994041,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 283513100,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 282277402,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 284078240,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 285115028,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 282270192,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 282252086,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 282868455,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 282248528,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 282232814,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 282245891,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 282247364,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 282341025,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 282274572,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 282245473,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 282326728,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Helps\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a little bit of the outlaw in everyone, and a little bit of the hero too.\n\nThe h... | TestCase-Eval | null | {
"problem_id": "2014A",
"submission_id": 282244946,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 267493439,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 267389099,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 286164994,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 267683272,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 269817174,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 267687322,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 267401526,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 270484623,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 290065831,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 267539463,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 268065895,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 267460669,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 267408695,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 267400430,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 267437651,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 281426090,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 267658756,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 267650168,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 267446628,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Number of k-good subarrays\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let $bit(x)$ denote the number of ones in the binary representation of a non... | TestCase-Eval | null | {
"problem_id": "1982E",
"submission_id": 267438609,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 297962943,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 298035230,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 300151747,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 297934348,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 298414092,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 305347206,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 307187952,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 302470316,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 303694964,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 301083048,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 301636386,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 305330634,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 298067469,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 297976772,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 298727822,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 298034808,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 299496011,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 297996087,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 297976449,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Joker\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Consider a deck of $$$n$$$ cards. The positions in the deck are numbered from $$$1$$$ to $$$n$$$ ... | TestCase-Eval | null | {
"problem_id": "2051F",
"submission_id": 297932682,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 285192155,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 282472348,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 284265139,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 284378276,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 282945247,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 282342293,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 283358449,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 282359817,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 283513070,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 282474270,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 282356501,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 282357034,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 282367024,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 295122344,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 282484055,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 282567485,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 282375892,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 284111497,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 282337421,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rendez-vous de Marian et Robin\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: In the humble act of meeting, joy doth unfold like a flower in bloom.\n\... | TestCase-Eval | null | {
"problem_id": "2014E",
"submission_id": 285194947,
"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.