Datasets:

TheFactoryX
/

edition_0843_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	untranslated_description stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
p00914 Equal Sum Sets	"Given a string s. Can you make it a palindrome by deleting exactly one character? Note that size of(...TRUNCATED)	{ "input": [ "3\n32\n100\n9085\n\nSAMPLE" ], "output": [ "2^5\n2^25^2\n2^05^123^179^1" ] }	{ "input": [], "output": [] }	{"input":["3,4,5\n5,5,8\n4,5,4\n5,4,3","3,3,5\n5,5,8\n4,4,4\n5,4,3","3,4,5\n5,5,8\n4,5,4\n3,4,5","3,(...TRUNCATED)	3	12	{"language":[2,4,2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	{"language":[4,2,1,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,0,0,2,2,2,2,4,2,2,2,3,0,2,2],(...TRUNCATED)	1,490	B	2,750	0	[ "" ]	false		{ "nanos": 500000000, "seconds": 0 }	256,000,000
p02120 Cluster Network	"Professor GukiZ doesn't accept string as they are. He likes to swap some letters in string to obtai(...TRUNCATED)	{"input":["9 6\n1 2 3 4 5 6 7 8 9\n1 4\n4 7\n2 5\n5 8\n3 6\n6 9\n"],"output":["7 8 9 4 5 6 1 2 3 \n"(...TRUNCATED)	{"input":["10 16\n9 8\n1 2\n9 5\n5 4\n9 2\n3 2\n1 6\n5 10\n7 2\n8 2\n3 7\n4 9\n5 7\n10 3\n10 9\n7 8\(...TRUNCATED)	{"input":["1000 4 750160753\n","2 7 727733989\n","994 9 410957831\n","269 4 817408561\n","386 5 4292(...TRUNCATED)	2	9	{ "language": [], "solution": [] }	{"language":[2,2,2,2,4,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,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	656		0	2,800	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
519_B. A and B and Compilation Errors	"You are given an array of n integers. For each element output the sum of itself and the previous el(...TRUNCATED)	{"input":["3 2\n? 1 2\n","5 1\n-10 -9 ? -7 -6\n","5 3\n4 6 7 2 9\n"],"output":["0 1 2\n","-10 -9 -8 (...TRUNCATED)	{"input":["3 1\n-2 3\n-2 -2\n","-8916 9282\n2666 2344\n9109 -2730\n","0 45\n42 -47\n-51 -82\n","45 6(...TRUNCATED)	{"input":["1\n0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0\n7\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n1 0 0 0 0 0 1 0 0(...TRUNCATED)	2	0	{"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": [], "solution": [] }	1,100	A	0	0	[ "binary search", "brute force", "dp", "two pointers" ]	true		null	0
1451_D. Circle Game	"Phoenix is trying to take a photo of his n friends with labels 1, 2, ..., n who are lined up in a r(...TRUNCATED)	{ "input": [ "1\n4 5\n9 7 5 3\n8 6 4 2 0\n\nSAMPLE" ], "output": [ "9 8 7 6 5 4 3 2 0\n" ] }	{"input":["50 1\n50 8 46 9 12 38 41 18 49 10 23 15 16 3 13 17 48 8 31 32 6 31 31 49 9 40 9 21 23 41 (...TRUNCATED)	{ "input": [], "output": [] }	5	0	{"language":[3,2,4,3,2,4,2,3,4,3,3,4,2,2,3,3,2,2,3,2,3,2,3,4,2,2,2,2,2,2,3,3,2,2,2,2,2,3,2,3,2,2,2,2(...TRUNCATED)	{"language":[2,2,0,2,2,3,2,2,2,2,3,2,2,2,2,2,3,2,2,2,3,2,2,3,2,0,2,3,2,3,2,2,3,2,3,0,0,2,2,2,2,3,2,4(...TRUNCATED)	990		0	1,800	[]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
70_C. Lucky Tickets	"Dark is going to attend Motarack's birthday. Dark decided that the gift he is going to give to Mota(...TRUNCATED)	{"input":["3\n1 3 2\n-100 2 3\n","2\n2 1\n-3 0\n","5\n2 1 4 3 5\n2 2 2 3 4\n"],"output":["3\n","0\n"(...TRUNCATED)	{"input":["20\n...............\n","97\n*..*.......**......................(...TRUNCATED)	{"input":["10 2 6\n1 2\n1 4\n2 1 8\n2 9 2\n1 2\n1 9\n2 3 5\n1 8\n","10 5 2\n1 2\n1 3\n2 4\n2 5\n1 6\(...TRUNCATED)	1	0	{"language":[4,2,2,4,2,2,2,2,4,2,3,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,1,4,2,2,2,4,2,2,4,2,2,2,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	1,466	A	1,500	0	[ "binary search", "greedy", "math" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
roys-life-cycle	"After playing Neo in the legendary \"Matrix\" trilogy, Keanu Reeves started doubting himself: maybe(...TRUNCATED)	{"input":["7\n5\n-1 10 -1 12 -1\n5\n-1 40 35 -1 35\n6\n-1 -1 9 -1 3 -1\n2\n-1 -1\n2\n0 -1\n4\n1 -1 3(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10\n669924290 408119795 283272835\n663737793 250734602 29671646\n431160679 146708815 2894(...TRUNCATED)	2	10	{"language":[2,2,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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	D	0	0	[]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
309_B. Context Advertising	"Monk's birthday is coming this weekend! He wants to plan a Birthday party and is preparing an invit(...TRUNCATED)	{ "input": [ "4 2\n", "6 3\n" ], "output": [ "7\n", "8\n" ] }	{ "input": [], "output": [] }	{"input":["100 10000\n337491026 878382762 942177429 998998997 292784016 407647544 813626083 20338593(...TRUNCATED)	6	12	{"language":[2,2,2,2,2,2,2,2,2,2,4,2,4,4,4,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,4,4,4,4,2,2,4,2,4,2,2,2,4(...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)	0	D	1,250	1,900	[ "constructive algorithms", "math", "sortings" ]	false	"太郎君はかけざんを習いたての小学生です。なんとなく、彼はかけざんを(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000
990_E. Post Lamps	"We have N integers. The i-th number is A_i.\n\n\\\\{A_i\\\\} is said to be pairwise coprime when GC(...TRUNCATED)	{"input":["2 1 0\n","2 2 4\n0 1 2 1\n0 1 2 1\n1 2 1 0\n1 1 1 2\n"],"output":["FIRST\n1 0 1 1\n","SEC(...TRUNCATED)	{"input":["20 18 1 2\n-9999944 -9999861 -9999850 -9999763 -9999656 -9999517 -9999375 -9999275 -99992(...TRUNCATED)	{"input":["20\n9 4 8\n10 6 7\n4 6 0\n7 7 6\n3 6 10\n4 2 1\n4 4 0\n2 0 0\n8 8 7\n3 1 7\n3 10 7\n1 7 3(...TRUNCATED)	2	6	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\n\(...TRUNCATED)	{"language":[4,2,2,2,2,2,4,2,2,4,2,2,4,2,4,2,2,2,2,4,2,2,4,2,4,2,4,4,4,3,4,2,2,2,2,2,2,2,3,2,2,2,2,1(...TRUNCATED)	0	D	1,500	0	[ "brute force", "dp", "strings", "two pointers" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
925_E. May Holidays	"Bhavana and Bhuvana place bet every time they see something interesting that can occur with a proba(...TRUNCATED)	{"input":["1 2\n3 4\n5 6\n","11 10\n13 8\n5 16\n","3 7\n4 6\n5 5\n","10 10\n10 10\n10 10\n"],"output(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\n2 2\nyz\n1 1\n2 2\nzy\n1 1\n","1\n11 2\nthisisatest\n3 7\n","3\n4 2\nabca\n1 3\n10 5\n(...TRUNCATED)	2	8	{"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":[2,2,2,2,2,2,2,2,2,4,2,0,2,2,4,2,2,2,2,2,4,2,2,2,2,0,2,2,2],"solution":["#include <bits/(...TRUNCATED)	0	B	0	1,700	[ "binary search", "brute force", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p03819 AtCoder Regular Contest 068 - Snuke Line	"You are given an equation: \n\nAx2 + Bx + C = 0. \n\nYour task is to find the number of distinct ro(...TRUNCATED)	{ "input": [ "2\n3\n10" ], "output": [ "1\n3" ] }	{"input":["1000\nspnogbxcrp\nbaukbqnmyu\nogxdxhtcwz\nbsjufplykz\nkhicdrdixl\nzookiqggel\nfczygjfhfa\(...TRUNCATED)	{ "input": [], "output": [] }	5	11	{"language":[4,2,1,1,3,2,3,3,4,2,4,4,2,3,4,3,2,4,1,2,2,3,1,2,2,2,4,1,2,4,3,3,2,4,4,4,1,3,1,4,4,1,2,4(...TRUNCATED)	{"language":[2,2,4,3,2,3,3,0,3,2,2,0,3,4,1,3,2,2,0,0,2,2,3,3,3,3,0,3,4,2,0,3,0,2,0,2,2,2,3,3,4,3,2,2(...TRUNCATED)	662	B3	0	2,100	[ "divide and conquer", "hashing", "sortings", "strings" ]	false		null	256,000,000