Datasets:

rl-llm-coders
/

cc_1k

Modalities:

Formats:

Size:

Libraries:

Dataset card Data Studio Files Files and versions Community

Dataset Viewer

Auto-converted to Parquet

Split (1)

train · 1k rows

name stringlengths 9 91	description stringlengths 30 7.63k	public_tests sequence	private_tests sequence	generated_tests sequence	source class label 3 classes	difficulty class label 14 classes	solutions sequence	incorrect_solutions sequence	cf_contest_id int64 0 1.55k	cf_index stringclasses 28 values	cf_points float32 0 3k	cf_rating int32 0 2.4k	cf_tags sequencelengths 0 7	is_description_translated bool 2 classes	untranslated_description stringclasses 135 values	time_limit dict	memory_limit_bytes int64 64M 1.07B	input_file stringclasses 2 values	output_file stringclasses 2 values
214_B. Hometask	"Furik loves math lessons very much, so he doesn't attend them, unlike Rubik. But now Furik wants to(...TRUNCATED)	{"input":["1\n0\n","11\n3 4 5 4 5 3 5 3 4 4 0\n","8\n3 2 5 1 5 2 2 3\n"],"output":["0\n","5554443330(...TRUNCATED)	{"input":["3\n0 0 1\n","3\n1 0 0\n","12\n3 1 2 3 2 0 2 2 2 0 2 3\n","10\n1 0 0 0 0 0 0 0 0 0\n","8\n(...TRUNCATED)	{"input":["3\n0 0 2\n","3\n3 0 0\n","12\n3 1 2 3 2 0 2 2 3 0 2 3\n","12\n5 3 3 6 2 5 5 1 2 1 4 1\n",(...TRUNCATED)	2CODEFORCES	8B	{"language":[2,4,4,4,3,4,4,3,2,3,4,4,4,4,2,4,4,2,3,2,2,1,3,4,2,2,4,2,4,1,3,2,4,2,4,4,4,1,2,2,1,2,1,2(...TRUNCATED)	{"language":[2,2,4,2,4,2,4,4,2,2,2,2,2,1,2,2,3,4,4,4,2,1,2,4,2,3,2,2,4,1,2,4,2,2,2,4,2,4,1,2,2,4,2,4(...TRUNCATED)	214	B	1,000	1,600	[ "brute force", "constructive algorithms", "greedy", "math" ]	false		{ "seconds": 2, "nanos": 0 }	256,000,000
1006_F. Xor-Paths	"There is a rectangular grid of size n × m. Each cell has a number written on it; the number on the(...TRUNCATED)	{"input":["3 4 1000000000000000000\n1 3 3 3\n0 3 3 2\n3 0 1 1\n","3 3 11\n2 1 5\n7 10 0\n12 6 4\n","(...TRUNCATED)	{"input":["1 1 982347923479\n1\n","2 10 2047\n1 2 4 8 16 32 64 128 256 512\n2 4 8 16 32 64 128 256 5(...TRUNCATED)	{"input":["2 10 2047\n1 2 4 8 16 32 64 128 256 512\n2 4 8 16 32 64 128 256 512 1863\n","2 20 2097151(...TRUNCATED)	2CODEFORCES	12F	{"language":[2,2,2,2,2,2,4,2,2,2,3,2,4,4,2,2,4,2,1,2,2,2,2,2,4,2,2,2,2,2,2,4,2,3,4,2,2,2,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,2,2,4,4,2,4,4,4,4,2,2,2,2,2,2,2,2,2,4,4,4,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	1,006	F	0	2,100	[ "bitmasks", "brute force", "dp", "meet-in-the-middle" ]	false		{ "seconds": 3, "nanos": 0 }	256,000,000
626_F. Group Projects	"There are n students in a class working on group projects. The students will divide into groups (so(...TRUNCATED)	{ "input": [ "3 2\n2 4 5\n", "4 0\n5 10 20 21\n", "4 3\n7 8 9 10\n" ], "output": [ "3\n", "1\n", "13\n" ] }	{"input":["200 558\n1 1 1 3 2 1 1 5 1 2 1 1 2 2 1 5 2 5 2 5 3 2 4 1 5 2 3 2 3 1 2 2 1 4 4 2 5 1 4 3 (...TRUNCATED)	{"input":["200 558\n1 1 1 3 2 1 1 5 1 2 1 1 2 2 1 5 2 5 2 5 3 2 4 1 5 2 3 2 3 1 2 2 1 4 4 2 5 1 4 3 (...TRUNCATED)	2CODEFORCES	12F	{"language":[2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,4,4,2,2,2,2,2,4,2,2,4,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,3,2,2,2,4,2,2,2,2,2,2,2,1,2,4,4,2,2,2,4,2,4,2,4,2,4,4,2,4,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	626	F	2,500	2,400	[ "dp" ]	false		{ "seconds": 2, "nanos": 0 }	256,000,000
300_C. Beautiful Numbers	"Vitaly is a very weird man. He's got two favorite digits a and b. Vitaly calls a positive integer g(...TRUNCATED)	{ "input": [ "1 3 3\n", "2 3 10\n" ], "output": [ "1\n", "165\n" ] }	{"input":["2 5 53049\n","8 9 111111\n","8 9 999999\n","6 9 1\n","2 4 88193\n","5 9 997693\n","1 6 99(...TRUNCATED)	{"input":["2 5 51373\n","3 9 111111\n","1 5 80791\n","1 4 31107\n","1 2 12116\n","1 2 10785\n","6 9 (...TRUNCATED)	2CODEFORCES	9C	{"language":[3,2,2,2,3,2,2,2,1,1,4,4,4,4,3,4,4,2,4,4,2,4,3,4,4,1,4,2,2,2,3,2,1,2,2,2,1,1,4,4,2,4,2,3(...TRUNCATED)	{"language":[2,3,2,2,2,1,2,2,2,4,2,2,3,4,4,4,4,2,4,2,4,4,4,2,2,2,1,2,4,4,4,2,2,4,4,4,2,2,3,4,2,2,2,2(...TRUNCATED)	300	C	2,000	1,800	[ "brute force", "combinatorics" ]	false		{ "seconds": 2, "nanos": 0 }	256,000,000
141_E. Clearing Up	"After Santa Claus and his assistant Elf delivered all the presents and made all the wishes come tru(...TRUNCATED)	{"input":["1 2\n1 1 S\n1 1 M\n","3 3\n1 2 S\n1 3 M\n2 3 S\n","5 6\n1 1 S\n1 2 M\n1 3 S\n1 4 M\n1 5 M(...TRUNCATED)	{"input":["11 17\n10 3 M\n5 9 M\n4 6 S\n11 4 M\n5 4 M\n11 4 M\n7 5 M\n9 8 M\n4 1 S\n8 6 M\n8 6 M\n5 (...TRUNCATED)	{"input":["5 11\n4 3 S\n2 5 M\n4 2 M\n5 2 S\n3 1 S\n4 2 M\n2 1 M\n4 1 M\n4 4 S\n2 1 S\n4 4 M\n","5 2(...TRUNCATED)	2CODEFORCES	11E	{"language":[2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	141	E	2,500	2,300	[ "constructive algorithms", "dp", "dsu", "graphs" ]	false		{ "seconds": 2, "nanos": 0 }	256,000,000
819_A. Mister B and Boring Game	"Sometimes Mister B has free evenings when he doesn't know what to do. Fortunately, Mister B found a(...TRUNCATED)	{ "input": [ "4 2 2 6\n", "1 1 1 8\n", "3 7 4 6\n" ], "output": [ "3\n", "2\n", "1\n" ] }	{"input":["6 1 1 10000\n","2 1 288 300\n","5 8 654321103 654321106\n","5 6 1000000000 1000000000\n",(...TRUNCATED)	{"input":["5 10 1000000000 1000000000\n","10 5 1 1001000000\n","12 1 1 1100000\n","1 8 280057261 834(...TRUNCATED)	2CODEFORCES	7A	{"language":[2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[3,4,4,3,2,4,2,2,1,4,3,2,2,2,2,2,1,2,2,2,4,2,4,3,2,2,4,2,2,2,2,2,4,4,2,3,2,1,2,2,2,2,3,1(...TRUNCATED)	819	A	500	2,200	[ "games", "greedy" ]	false		{ "seconds": 2, "nanos": 0 }	256,000,000
598_E. Chocolate Bar	"You have a rectangular chocolate bar consisting of n × m single squares. You want to eat exactly k(...TRUNCATED)	{"input":["4\n2 2 1\n2 2 3\n2 2 2\n2 2 4\n"],"output":[" (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4\n2 2 1\n2 2 1\n2 2 2\n2 2 4\n","4\n2 2 2\n2 2 1\n2 2 2\n2 2 4\n","4\n2 2 4\n2 2 1\n2 2 (...TRUNCATED)	2CODEFORCES	11E	{"language":[4,2,4,4,3,2,2,4,2,4,2,4,3,2,4,2,2,4,3,2,2,2,2,3,2,4,2,4,4,4,2,4,2,4,2,2,2,4,3,2,4,4,2,2(...TRUNCATED)	{"language":[3,2,4,4,4,3,2,4,2,2,4,2,2,3,2,3,2,2,3,2,4,4,2,4,2,4,2,2,2,2,2,3,4,3,2,3,3,3,2,4,2,2,2,2(...TRUNCATED)	598	E	0	2,000	[ "brute force", "dp" ]	false		{ "seconds": 2, "nanos": 0 }	256,000,000
353_D. Queue	"There are n schoolchildren, boys and girls, lined up in the school canteen in front of the bun stal(...TRUNCATED)	{ "input": [ "MFM\n", "FFMMM\n", "MMFF\n" ], "output": [ "1", "0", "3" ] }	{"input":["MFFFMMFMFMFMFFFMMMFFMMMMMMFMMFFMMMFMMFMFFFMMFMMMFFMMFFFFFMFMFFFMMMFFFMFMFMFMFFFMMMMFMMFMM(...TRUNCATED)	{"input":["FMMMFMF\n","MFFMMFMMMFMMFFMFMFMFFMMFFFMMFMFFFFMMFMFFMMMMMMFFMMFMMFMMFMFFMMMMMFMMMMMMFMFFF(...TRUNCATED)	2CODEFORCES	10D	{"language":[2,2,2,2,2,2,2,2,2,4,2,2,4,2,4,2,2,1,4,2,2,2,2,2,4,4,2,2,2,4,3,2,2,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)	{"language":[2,2,4,4,2,4,2,4,2,2,3,2,2,2,4,2,3,2,4,2,2,2,2,2,4,2,4,4,2,2,4,3,4,4,1,4,2,2,2,3,4,2,2,2(...TRUNCATED)	353	D	2,500	2,000	[ "constructive algorithms", "dp" ]	false		{ "seconds": 1, "nanos": 0 }	256,000,000
54_C. First Digit Law	"In the probability theory the following paradox called Benford's law is known: \"In many lists of r(...TRUNCATED)	{ "input": [ "2\n1 2\n9 11\n50\n", "1\n1 2\n50\n" ], "output": [ "0.833333333333333\n", "0.500000000" ] }	{"input":["1\n1 1000000000000000000\n50\n","1\n1 1\n100\n","15\n11 20\n16 18\n10 17\n11 17\n2 19\n12(...TRUNCATED)	{"input":["1\n1 1000000000100000000\n50\n","10\n5 20\n13 16\n12 30\n7 16\n10 29\n21 21\n22 26\n14 22(...TRUNCATED)	2CODEFORCES	9C	{"language":[4,2,1,2,2,2,2,1,2,2,2,2,2,2,2,2,4,2,2,4,2,4,4,2,2,2,2,2,2,2,2,4,2,2,2,4,4,2,2,2,2,4,4,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,4,4,4,2,2,2,4,2,4,2,2,2,2,2,2,4,2(...TRUNCATED)	54	C	1,500	2,000	[ "dp", "math", "probabilities" ]	false		{ "seconds": 2, "nanos": 0 }	256,000,000
1214_E. Petya and Construction Set	"It's Petya's birthday party and his friends have presented him a brand new \"Electrician-n\" constr(...TRUNCATED)	{"input":["4\n2 2 2 1\n","6\n2 2 2 2 2 2\n","3\n2 2 2\n","2\n1 1\n"],"output":["5 3\n3 1\n1 7\n3 6\n(...TRUNCATED)	{"input":["4\n2 2 2 2\n","99\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 (...TRUNCATED)	{"input":["4\n2 2 0 2\n","99\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 (...TRUNCATED)	2CODEFORCES	11E	{"language":[2,2,2,2,2,4,4,2,4,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,3,4(...TRUNCATED)	{"language":[2,2,2,4,4,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,3,2(...TRUNCATED)	1,214	E	2,500	2,000	[ "constructive algorithms", "graphs", "math", "sortings", "trees" ]	false		{ "seconds": 1, "nanos": 0 }	512,000,000

End of preview. Expand in Data Studio

README.md exists but content is empty.

Downloads last month: 140

Size of the auto-converted Parquet files:

Number of rows: