Datasets:

Tommysha
/

zero-code-l1-cc-valid

id stringlengths 11 46	question stringlengths 828 4.77k	question_title stringlengths 11 48	platform stringclasses 1 value	difficulty stringclasses 9 values	public_test_cases stringlengths 71 679	private_test_cases stringlengths 2 4.73M	metadata stringclasses 1 value
1548_C._The_Three_Little_Pigs	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: Three little pigs from all over the world are meeting for a convention! Every minute, a triple of 3 new pigs arrives on the convention floor. After the n-th min...	1548_C. The Three Little Pigs	codeforces	C	[{"input": "2 3\n1\n5\n6\n", "output": "9\n6\n1\n", "testtype": "stdin"}, {"input": "5 4\n2\n4\n6\n8\n", "output": "225\n2001\n6014\n6939\n", "testtype": "stdin"}]	[{"input": "1 3\n1\n2\n3\n", "output": "3\n3\n1\n", "testtype": "stdin"}, {"input": "3 9\n1\n2\n3\n4\n5\n6\n7\n8\n9\n", "output": "18\n54\n105\n141\n132\n85\n36\n9\n1\n", "testtype": "stdin"}]	{}
1548_D1._Gregor_and_the_Odd_Cows_Easy	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: This is the easy version of the problem. The only difference from the hard version is that in this version all coordinates are even. There are n fence-posts at...	1548_D1. Gregor and the Odd Cows (Easy)	codeforces	D	[{"input": "5\n0 0\n2 16\n30 14\n4 6\n2 10\n", "output": "3\n", "testtype": "stdin"}, {"input": "3\n0 0\n2 0\n0 4\n", "output": "1\n", "testtype": "stdin"}]	[{"input": "20\n200 716\n88 526\n434 134\n996 890\n718 220\n820 462\n614 178\n848 208\n724 536\n124 710\n408 228\n846 606\n222 32\n642 180\n694 964\n438 994\n718 524\n688 692\n126 494\n102 116\n", "output": "650\n", "testtype": "stdin"}, {"input": "4\n12 10\n6 14\n2 6\n6 12\n", "output": "2\n", "testtype": "stdin"}]	{}
1548_D2._Gregor_and_the_Odd_Cows_Hard	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: This is the hard version of the problem. The only difference from the easy version is that in this version the coordinates can be both odd and even. There are ...	1548_D2. Gregor and the Odd Cows (Hard)	codeforces	D	[{"input": "10\n170 59\n129 54\n5 98\n129 37\n58 193\n154 58\n24 3\n13 138\n136 144\n174 150\n", "output": "29\n", "testtype": "stdin"}, {"input": "3\n0 0\n2 0\n0 4\n", "output": "1\n", "testtype": "stdin"}, {"input": "4\n1 8\n0 6\n5 2\n5 6\n", "output": "1\n", "testtype": "stdin"}]	[]	{}
1548_E._Gregor_and_the_Two_Painters	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: Two painters, Amin and Benj, are repainting Gregor's living room ceiling! The ceiling can be modeled as an n × m grid. For each i between 1 and n, inclusive, p...	1548_E. Gregor and the Two Painters	codeforces	E	[{"input": "3 4 12\n9 8 5\n10 6 7 2\n", "output": "1\n", "testtype": "stdin"}, {"input": "3 4 11\n9 8 5\n10 6 7 2\n", "output": "2\n", "testtype": "stdin"}, {"input": "5 23 6\n1 4 3 5 2\n2 3 1 6 1 5 5 6 1 3 2 6 2 3 1 6 1 4 1 6 1 5 5\n", "output": "6\n", "testtype": "stdin"}, {"input": "3 3 2\n1 2 1\n1 2 1\n", "output":...	[{"input": "1 1 2\n1\n1\n", "output": "1\n", "testtype": "stdin"}, {"input": "1 1 1\n1\n1\n", "output": "0\n", "testtype": "stdin"}, {"input": "3 3 4\n2 3 2\n3 2 2\n", "output": "2\n", "testtype": "stdin"}, {"input": "5 5 6\n1 2 3 4 5\n5 4 3 2 1\n", "output": "1\n", "testtype": "stdin"}, {"input": "3 3 7\n3 4 3\n3 4 3\...	{}
1549_A._Gregor_and_Cryptography	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: Gregor is learning about RSA cryptography, and although he doesn't understand how RSA works, he is now fascinated with prime numbers and factoring them. Gregor...	1549_A. Gregor and Cryptography	codeforces	A	[{"input": "2\n17\n5\n", "output": "2 16\n2 4\n", "testtype": "stdin"}]	[{"input": "2\n17\n5\n", "output": "2 16\n2 4\n", "testtype": "stdin"}, {"input": "1\n55439\n", "output": "2 55438\n", "testtype": "stdin"}, {"input": "5\n5\n7\n11\n13\n19\n", "output": "2 4\n2 6\n2 10\n2 12\n2 18\n", "testtype": "stdin"}]	{}
1549_B._Gregor_and_the_Pawn_Game	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: There is a chessboard of size n by n. The square in the i-th row from top and j-th column from the left is labelled (i,j). Currently, Gregor has some pawns in ...	1549_B. Gregor and the Pawn Game	codeforces	B	[{"input": "4\n3\n000\n111\n4\n1111\n1111\n3\n010\n010\n5\n11001\n00000\n", "output": "3\n4\n0\n0\n", "testtype": "stdin"}]	[{"input": "1\n20\n01001100111111000100\n00101100011010001110\n", "output": "8\n", "testtype": "stdin"}]	{}
1549_C._Web_of_Lies	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: When you play the game of thrones, you win, or you die. There is no middle ground. Cersei Lannister, A Game of Thrones by George R. R. Martin There are n nobl...	1549_C. Web of Lies	codeforces	C	[{"input": "4 3\n2 1\n1 3\n3 4\n4\n3\n1 2 3\n2 3 1\n3\n", "output": "2\n1\n", "testtype": "stdin"}, {"input": "4 3\n2 3\n3 4\n4 1\n1\n3\n", "output": "1\n", "testtype": "stdin"}]	[{"input": "3 0\n2\n1 2 1\n3\n", "output": "2\n", "testtype": "stdin"}, {"input": "20 0\n1\n3\n", "output": "20\n", "testtype": "stdin"}, {"input": "1000 0\n1\n3\n", "output": "1000\n", "testtype": "stdin"}, {"input": "20 0\n20\n3\n3\n1 17 19\n1 19 20\n1 4 8\n1 9 18\n1 1 14\n1 16 19\n1 10 19\n1 1 7\n1 6 10\n1 18 19\n1 ...	{}
1549_D._Integers_Have_Friends	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: British mathematician John Littlewood once said about Indian mathematician Srinivasa Ramanujan that "every positive integer was one of his personal friends." I...	1549_D. Integers Have Friends	codeforces	D	[{"input": "4\n5\n1 5 2 4 6\n4\n8 2 5 10\n2\n1000 2000\n8\n465 55 3 54 234 12 45 78\n", "output": "3\n3\n2\n6\n", "testtype": "stdin"}]	[{"input": "1\n3\n1 137438953474 274877906947\n", "output": "3\n", "testtype": "stdin"}, {"input": "5\n1\n13\n1\n1\n6\n7 19 28 25 4 10\n3\n3 19 10\n9\n26 1 28 8 24 27 12 16 17\n", "output": "1\n1\n6\n2\n3\n", "testtype": "stdin"}, {"input": "1\n69\n2 4 10 16 22 28 34 40 46 52 58 64 70 76 82 88 94 100 106 112 118 124 13...	{}
1551_A._Polycarp_and_Coins	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: Polycarp must pay exactly n burles at the checkout. He has coins of two nominal values: 1 burle and 2 burles. Polycarp likes both kinds of coins equally. So he ...	1551_A. Polycarp and Coins	codeforces	A	[{"input": "6\n1000\n30\n1\n32\n1000000000\n5\n", "output": "334 333\n10 10\n1 0\n10 11\n333333334 333333333\n1 2\n", "testtype": "stdin"}]	[{"input": "1\n10111\n", "output": "3371 3370\n", "testtype": "stdin"}, {"input": "1\n10555\n", "output": "3519 3518\n", "testtype": "stdin"}, {"input": "2\n3000002\n3000001\n", "output": "1000000 1000001\n1000001 1000000\n", "testtype": "stdin"}, {"input": "1\n3000002\n", "output": "1000000 1000001\n", "testtype": "st...	{}
1551_B1._Wonderful_Coloring_-_1	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: This is a simplified version of the problem B2. Perhaps you should read the problem B2 before you start solving B1. Paul and Mary have a favorite string s whic...	1551_B1. Wonderful Coloring - 1	codeforces	B	[{"input": "5\nkzaaa\ncodeforces\narchive\ny\nxxxxxx\n", "output": "2\n5\n3\n0\n1\n", "testtype": "stdin"}]	[{"input": "1\ndscnjksdcnsjkvndfjkvndfjkvnkdfnv\n", "output": "8\n", "testtype": "stdin"}, {"input": "1\naa\n", "output": "1\n", "testtype": "stdin"}, {"input": "1\nabbdsdndsncjksdncjkdsncknsdkcnskc\n", "output": "7\n", "testtype": "stdin"}, {"input": "61\nkzaaa\ncodeforces\narchive\ny\nxxxxxx\nkzaaa\ncodeforces\narchi...	{}
1551_B2._Wonderful_Coloring_-_2	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: This problem is an extension of the problem "Wonderful Coloring - 1". It has quite many differences, so you should read this statement completely. Recently, Pa...	1551_B2. Wonderful Coloring - 2	codeforces	B	[{"input": "6\n10 3\n3 1 1 1 1 10 3 10 10 2\n4 4\n1 1 1 1\n1 1\n1\n13 1\n3 1 4 1 5 9 2 6 5 3 5 8 9\n13 2\n3 1 4 1 5 9 2 6 5 3 5 8 9\n13 3\n3 1 4 1 5 9 2 6 5 3 5 8 9\n", "output": "2 1 2 3 0 1 3 2 3 1 \n1 2 3 4 \n1 \n1 1 1 0 1 1 1 1 0 0 0 1 0 \n2 1 2 2 1 1 1 1 2 1 0 2 2 \n1 1 3 2 1 3 3 1 2 2 3 2 0 \n", "testtype": "stdi...	[{"input": "12\n10 3\n3 1 1 1 1 10 3 10 10 2\n4 4\n1 1 1 1\n1 1\n1\n13 1\n3 1 4 1 5 9 2 6 5 3 5 8 9\n13 2\n3 1 4 1 5 9 2 6 5 3 5 8 9\n13 3\n3 1 4 1 5 9 2 6 5 3 5 8 9\n10 3\n3 1 1 1 1 10 3 10 10 2\n4 4\n1 1 1 1\n1 1\n1\n13 1\n3 1 4 1 5 9 2 6 5 3 5 8 9\n13 2\n3 1 4 1 5 9 2 6 5 3 5 8 9\n13 3\n3 1 4 1 5 9 2 6 5 3 5 8 9\n",...	{}
1551_C._Interesting_Story	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: Stephen Queen wants to write a story. He is a very unusual writer, he uses only letters 'a', 'b', 'c', 'd' and 'e'! To compose a story, Stephen wrote out n wor...	1551_C. Interesting Story	codeforces	C	[{"input": "6\n3\nbac\naaada\ne\n3\naba\nabcde\naba\n2\nbaba\nbaba\n4\nab\nab\nc\nbc\n5\ncbdca\nd\na\nd\ne\n3\nb\nc\nca\n", "output": "3\n2\n0\n2\n3\n2\n", "testtype": "stdin"}]	[]	{}
1551_D1._Domino_easy_version	You will be given a question (problem specification) and will generate a correct Python program that matches the specification and passes all tests. Question: The only difference between this problem and D2 is that you don't have to provide the way to construct the answer in this problem, but you have to do it in D2. ...	1551_D1. Domino (easy version)	codeforces	D	[{"input": "8\n4 4 2\n2 3 0\n3 2 3\n1 2 0\n2 4 2\n5 2 2\n2 17 16\n2 1 1\n", "output": "YES\nYES\nYES\nNO\nYES\nNO\nYES\nNO\n", "testtype": "stdin"}]	[{"input": "1\n6 7 20\n", "output": "NO\n", "testtype": "stdin"}, {"input": "10\n26 80 521\n34 14 232\n62 66 767\n80 72 2664\n70 50 461\n85 92 108\n59 44 732\n55 6 13\n47 22 504\n79 16 8\n", "output": "NO\nYES\nNO\nYES\nNO\nYES\nYES\nYES\nNO\nYES\n", "testtype": "stdin"}, {"input": "10\n8 67 208\n87 58 1834\n96 82 2079...	{}

End of preview. Expand in Data Studio

zero-code L1 validation set — CodeContests valid (117)

Independent validation for Zevo task zero-code-l1 checkpoint selection.

Source: HuggingFace deepmind/code_contests split valid (117 problems).
Schema: same fields as the L1 LiveCodeBench test set (id, question, public_test_cases, private_test_cases, metadata).
Tests: CodeContests public_tests + private_tests only (generated_tests omitted). testtype is stdin; metadata is {} so the LCB evaluator uses standard input grading.
This is not LiveCodeBench and is not an official LCB baseline. The task test set stays Tommysha/zero-code-l1-lcb-v5-test (279, 2024-08-01 to 2025-02-01).
Scoring: evaluator.py (LiveCodeBench testing_util, 6 s per test, all tests must pass) → pass@1.

Downloads last month: 35