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: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 292621205,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 292112266,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 290753556,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 295680658,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 295479020,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 295354975,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 295348384,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 290754117,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 290767669,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 290754459,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 290760691,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 290754912,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 290753782,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 292300927,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 290757216,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 290847096,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 291105704,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 295987481,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 290744918,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Message Spread\ntime_limit_ms: 12000\nmemory_limit_mb: 1024\nDescription: Given is an undirected graph with $n$ vertices and $m$ edges. Each edge connects two v... | TestCase-Eval | null | {
"problem_id": "2029H",
"submission_id": 293595636,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 293278151,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 302460000,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 294345120,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 302594738,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 302507726,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 302359420,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 306455573,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 301639807,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 297164279,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 293053419,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 293569164,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 293891986,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 295936049,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 293904031,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 293459663,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 293342338,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 293040561,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 293047290,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 293590327,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Bento Box Adventure\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Image generated by ChatGPT 4o.\n\nBoxed meals in Taiwan are very common, offer... | TestCase-Eval | null | {
"problem_id": "2041A",
"submission_id": 298456859,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 287216205,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 288875677,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 287911363,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 281106313,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 279838405,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 290875007,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 279592635,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 296807493,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 285648380,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 279615146,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 279555689,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 279538495,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 279590114,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 280737573,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 279595458,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 279886850,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 304172517,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 279613982,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 279555320,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Legend of Freya the Frog\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Freya the Frog is traveling on the 2D coordinate plane. She is currently a... | TestCase-Eval | null | {
"problem_id": "2009C",
"submission_id": 279583571,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 286852073,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 286807759,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 286816469,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 289040941,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 286803733,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 286802631,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 286810276,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 286809722,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 286791373,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 286817564,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 286889572,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 289100679,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 289954359,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 287089689,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 286795622,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 286817717,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 286810000,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 286805466,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 286834161,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: QED's Favorite Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: QED is given a permutation$^{\\text{∗}}$ $p$ of length $n$. He also has a st... | TestCase-Eval | null | {
"problem_id": "2030D",
"submission_id": 293443135,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 277230973,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 269368394,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 279278417,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 295251611,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 285841120,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 273405860,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 269280326,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 270546954,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 270765869,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 271836040,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 269280792,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 269277948,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 269436162,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 269286885,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 293527805,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 269426198,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 269688083,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 269325804,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 270547052,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: array-value\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You have an array of non-negative integers $a_1, a_2, \\ldots, a_n$.\n\nThe value of a sub-... | TestCase-Eval | null | {
"problem_id": "1983F",
"submission_id": 269282010,
"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.