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: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287800631,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287806481,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287759585,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287753161,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287755941,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287753174,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287783880,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287800824,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287785100,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287725545,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287776720,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 293794588,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 292850566,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287774016,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287757155,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287707886,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287803945,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287734790,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287733962,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Field Trip\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Even in university, students need to relax. That is why Sakurakos teacher decided... | TestCase-Eval | null | {
"problem_id": "2033C",
"submission_id": 287813327,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 265434107,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 265650542,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 265802589,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 265383366,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 294857862,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 267284977,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 265396453,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 265299727,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 265627978,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 265375315,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 265454437,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 271881451,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 265380446,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 266397324,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 268299716,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 266137464,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 266637359,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 265374037,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 270362065,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize the Largest Component (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Easy and hard versions are actually different problems, s... | TestCase-Eval | null | {
"problem_id": "1985H2",
"submission_id": 265845193,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 291993725,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 291974158,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 292098923,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 292083968,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 292017304,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 292016791,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 292008190,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 292052150,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 292032305,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 300894284,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 306087453,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 292011425,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 294340302,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 292009226,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 291985593,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 291966953,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 292110711,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 296020098,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 294139119,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Twice\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kinich wakes up to the start of a new day. He turns on his phone, checks his mailbox, and finds a... | TestCase-Eval | null | {
"problem_id": "2037A",
"submission_id": 291978996,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 267568323,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 264906374,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 266829588,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 264907868,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 264904768,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 264951578,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 264907360,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 267184763,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 264878193,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 264920045,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 264895301,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 264899239,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 264972786,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 264922403,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 272932294,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 264958461,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 264902046,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 265046089,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 267945009,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Large Addition\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: A digit is large if it is between $5$ and $9$, inclusive. A positive integer is large if... | TestCase-Eval | null | {
"problem_id": "1984B",
"submission_id": 264943207,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 299444255,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 267873196,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 256648445,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 256319471,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 256323054,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 267987472,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 256323700,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 256377882,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 256329710,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 256309448,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 256292064,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 266121320,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 256338598,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 256285194,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 256287422,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 256320947,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 256269885,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 256309930,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 256310910,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make It Ugly\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's call an array $$$a$$$ beautiful if you can make all its elements the same by using t... | TestCase-Eval | null | {
"problem_id": "1954B",
"submission_id": 256312064,
"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.