Datasets:

TheFactoryX
/

edition_1303_deepmind-code_contests-readymade

name stringlengths 4 70	description stringlengths 31 8.62k	public_tests dict	private_tests dict	generated_tests dict	source int64 1 6	difficulty int64 0 21	solutions dict	incorrect_solutions dict	cf_contest_id int64 0 1.55k	cf_index stringclasses 23 values	cf_points float64 0 3.75k	cf_rating int64 0 3.5k	cf_tags listlengths 0 7	is_description_translated bool 2 classes	time_limit dict	memory_limit_bytes int64 0 1.07B
730_G. Car Repair Shop	"Some country is populated by wizards. They want to organize a demonstration.\n\nThere are n people (...TRUNCATED)	{ "input": [ "2\n2\nbhopal\ndelhi\n3\nbhopal\ndelhi\ndehradun\n\nSAMPLE" ], "output": [ "YES\nNO\n" ] }	{"input":["qH\n2\n","nifzlTLaeWxTD\n0\n","WlwbRjvrOZakKXqecEdlrCnmvXQtLKBsy\n5\n","LiqWMLEULRhW\n1\n(...TRUNCATED)	{"input":["100\n591 417 888 251 792 847 31 3 182 461 102 348 555 956 771 901 712 878 580 631 342 333(...TRUNCATED)	1	10	{"language":[2,3,2,2,4,3,3,3,3,4,4,4,3,4,2,3,3,2,3,3,2,4,3,3,3,2,2,1,3,3,3,3,4,3,1,4,3,3,3,2,3,2,3,3(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	800	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
p03986 AtCoder Grand Contest 005 - STring	"Let c be some positive integer. Let's call an array a_1, a_2, …, a_n of positive integers c-array(...TRUNCATED)	{ "input": [ "2\n1 23\n\nSAMPLE" ], "output": [ "NO\n" ] }	{"input":["10 10\n5 9 1 3 5 8 3 4 7\n2 0 4 7 1 0 0 0 7 0\n5 7 -7 3 10 4 7 2 9 -9\n","2 2\n1\n0 0\n1 (...TRUNCATED)	{"input":["6\n5 2 4 6 1 0","6\n5 6 4 4 1 3","6\n6 2 4 6 1 0","6\n5 6 4 4 1 2","6\n6 2 4 6 0 0","6\n5(...TRUNCATED)	5	9	{"language":[2,1,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,1,2,4,1,1,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2(...TRUNCATED)	{ "language": [], "solution": [] }	5		0	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
152_E. Garden	"Ori and Sein have overcome many difficult challenges. They finally lit the Shrouded Lantern and fou(...TRUNCATED)	{"input":["5 9\n10345\n23456\n34567\n45678\n56789\n","2 10\n12\n43\n","3 12\n1423\n6624\n6625\n"],"o(...TRUNCATED)	{"input":["+-+--+-+\n","+-+--+\n","+-+++-\n","+++-\n","-++-+--++--+-++-\n","-+++--\n","-+--+-\n","+-(...TRUNCATED)	{"input":["1 10\n8\n1\n2\n3\n4\n5\n6\n7\n13\n9\n16\n","1 10\n2\n1\n2\n3\n4\n5\n6\n7\n8\n3\n16\n","1 (...TRUNCATED)	1	11	{"language":[2,2,2,3,2,2,2,3,4,3,2,2,3,2,4,3,2,2,2,3,3,3,2,3,3,2,2,3,2,2,1,2,3,2,3,4,4,3,2,2,2,2,3,3(...TRUNCATED)	{"language":[2,4,2,2,3,3,4,3,3,4,1,3,2,3,2,4,2,3,4,2,3,3,2,2,2,4,3,2,3,4,2,2,4,4,3,2,4,2,3,2,4,3,4,3(...TRUNCATED)	1,117		1,000	1,900	[ "binary search", "data structures", "hashing" ]	false	{ "nanos": 0, "seconds": 2 }	512,000,000
p02014 Rough Sorting	"In the game Lizard Era: Beginning the protagonist will travel with three companions: Lynn, Meliana (...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	{"input":["5 5\n-993655555 -758584352 -725954642 -696391700 -649643547\n-591473088 -568010221 -43211(...TRUNCATED)	1	0	{"language":[2,2,4,2,2,3,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4(...TRUNCATED)	{ "language": [], "solution": [] }	0	C	0	0	[]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
455_C. Civilization	"Two coordinates (a1, a2) and (b1, b2) on a two-dimensional grid of r × c are given. The cost of mo(...TRUNCATED)	{"input":["1\n7\nchandu\nparo\nrahul\nmohi\nparo\narindam\nrahul\n\nSAMPLE"],"output":["arindam\ncha(...TRUNCATED)	{"input":["1 1\n0\n10000\n","2 3\n1 0\n4 7\n","1 2\n0\n10000\n","3 10\n0 1 2\n9240 5331 6721\n","4 1(...TRUNCATED)	{ "input": [], "output": [] }	2	13	{"language":[2,4,4,2,4,2,4,2,4,4,2,2,4,4,2,2,3,4,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	{"language":[2,4,4,3,4,2,3,2,2,4,4,1,2,1,2,4,3,4,3,3,4,3,1,3,2,4,2,3,3,3,3,2,4,3,2,3,3,4,2,2,3,4,4,2(...TRUNCATED)	1,391		0	0	[ "dfs and similar", "graphs" ]	false	{ "nanos": 0, "seconds": 1 }	1,073,741,824
p03940 AtCoder Grand Contest 007 - Shik and Game	"Polycarp plays a well-known computer game (we won't mention its name). Every object in this game co(...TRUNCATED)	{ "input": [ "3\n1 2 4\n", "3\n5 3 1\n" ], "output": [ "3", "1" ] }	{ "input": [], "output": [] }	{"input":["3 313 856 964 421\n","3 3 1 11 9\n","2 2 9 8 1\n","61 538 623 89 548\n","7 202 512 995 37(...TRUNCATED)	2	0	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[3,4,3,4,3,2,4,4,4,3,2,3,3,2,4,1,2,4,2,4,4,4,3,4,1,3,2,2,2,3,2,4,3,3,2,3,2,2,3,1,4,2,3,3(...TRUNCATED)	1,155	A	0	1,800	[]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p03297 AtCoder Grand Contest 026 - rng_10s	"ZS the Coder has drawn an undirected graph of n vertices numbered from 0 to n - 1 and m edges betwe(...TRUNCATED)	{"input":["7\nbabba\nabaac\ncodeforces\nzeroorez\nabcdcba\nbbbbbbb\na\n"],"output":["\n1\n1\n0\n1\n1(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4000 4000 2\n","3 300 167\n","3 300 2\n","4 4 2\n","3 2 70\n","1625 3998 2\n","300 403 30(...TRUNCATED)	2	9	{"language":[2,1,3,3,3,4,2,3,1,1,2,4,2,3,4,4,3,1,1,3,4,4,3,3,2,3,3,4,2,3,2,2,3,3,4,3,3,3,1,2,3,2,2,3(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,1,2,2,2,2,2,2(...TRUNCATED)	1,227	E	500	2,100	[ "brute force" ]	false	null	536,870,912
p02971 AtCoder Beginner Contest 134 - Exception Handling	Example Input 3 2 3 1 2 1 2 3 2 3 3 1 Output 1	{ "input": [ "3\n1\n0 1\n0 0\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1" ], "output": [ "yes\nyes\nno\n" ] }	{ "input": [], "output": [] }	{"input":["10\n4643665 282618243 791521863 214307200 976959598 590907019 166397456 708291256 8537738(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2],"solution":["#include <iostream>\n#include <iomanip>\n#include <comple(...TRUNCATED)	{ "language": [], "solution": [] }	0	D	1,750	1,500	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	0
1081_G. Mergesort Strikes Back	"Problem description.\nVipul is a hardworking super-hero who maintains the bracket ratio of all the (...TRUNCATED)	{ "input": [ "4\n4 4 4\n", "5\n2 3 5 5\n" ], "output": [ "6\n", "17\n" ] }	{"input":["aabbaaaa\naaaaabab\n","qgiufelsfhanx\naaaaaaaaaaaaa\n","abcddd\nbacddd\n","azzz\nzzaz\n",(...TRUNCATED)	{"input":["10 20 11\njsnr u eq qas gcj rnnf fpb c dz g\n","10 10 19\nlguv zi riht pf jtbo qmj qp nvh(...TRUNCATED)	2	9	{"language":[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,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,2,2,2,2,1,4,3,2,2,2,2,2,1,2,3,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	A	2,000	1,100	[ "combinatorics", "dp", "math", "probabilities" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
chefrp	"Serge came to the school dining room and discovered that there is a big queue here. There are m pup(...TRUNCATED)	{ "input": [ "1\n", "6\n", "30\n" ], "output": [ "1\n0", "2", "1\n6" ] }	{"input":["20 20 20\n18 16\n4 20\n2 5\n7 4\n11 13\n6 10\n20 8\n14 6\n3 12\n5 1\n16 7\n10 9\n1 11\n12(...TRUNCATED)	{"input":["5\n42665793 93310343 856080769 176604645 248258165\n10\n1 5 141156007\n2 5 5 3\n2 4 4 2\n(...TRUNCATED)	6	0	{"language":[3,2,4,4,2,3,3,2,3,3,4,2,2,4,2,2,2,2,4,3,3,2,4,2,2,3,4,3,4,2,3,2,4,2,2,4,2,3,2,4,2,3,3,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,4,3,2,2,3,2,2,2,2,2,2,2,2,4,3,2,2,2,2,1,2,4,2,2,2,2,2,4,2,2,3,1(...TRUNCATED)	814	A	0	0	[ "brute force", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000