Datasets:

TheFactoryX
/

edition_2438_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
p00490 Best Pizza	"Andrew plays a game called \"Civilization\". Dima helps him.\n\nThe game has n cities and m bidirec(...TRUNCATED)	{ "input": [ "4\n2 5\n9 7\n15 6\n9 3" ], "output": [ "3" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	6	9	{"language":[3,2,4,2,2,4,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,4,4,4,4,2,2,2,2,4,4,2,2,1,2,2,2,4,2,4,2,2,4,2(...TRUNCATED)	{"language":[3,2,2,3,4,2,4,3,2,2,1,2,4,3,4,3,2,3,2,2,4,2,3,2,2,2,3,4,4,3,2,2,3,2,2,3,4,2,2,2,2,2,3,4(...TRUNCATED)	0	B	0	3,000	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
630_A. Again Twenty Five!	"Sherlock Holmes loves mind palaces! We all know that.\n\nA mind palace, according to Mr. Holmes is (...TRUNCATED)	{"input":["4 2 3 1","7834164883628 15 2189823423122 5771212644938","4 2 1 1","4 1 1 4"],"output":["0(...TRUNCATED)	{"input":["1 5000 4999\n","2 1 0\n","83 2813 123\n","93 2364 2364\n","100 1 0\n","21 862 387\n","1 1(...TRUNCATED)	{"input":["3\n6 13 24","3\n6 4 30","3\n12 11 12","3\n6 20 24","3\n6 7 30","3\n11 20 24","3\n10 7 30"(...TRUNCATED)	5	6	{"language":[2,2,2,4,4,2,2,2,2,2,4,2,2,2,4,2,4,2,4,4,2,4,2,4,2,2,4,2,2,2,4,2,2,4,4,4,2,4,2,4,4,1,4,4(...TRUNCATED)	{"language":[4,4,2,2,2,4,2,2,2,2,2,2,2,4,4,4,4,2,2,4,3,2,4,4,2,1,4,2,4,4,2,3,3,4,2,2,2,2,4,2,2,4,2,2(...TRUNCATED)	867	C	500	0	[]	false	"\n\n問題\n\nAORイカちゃんはテストに合格するため勉強しています。\n\nAORイ(...TRUNCATED)	null	256,000,000
p02408 Finding Missing Cards	"Professor GukiZ doesn't accept string as they are. He likes to swap some letters in string to obtai(...TRUNCATED)	{"input":["2\n1 2\n1 2\n","4\n100 42\n42 100\n5 42\n100 5\n","3\n1 2\n2 4\n3 4\n"],"output":["0\n","(...TRUNCATED)	{ "input": [ "abcdabcdab\n5\n2 2 8 ab\n2 1 10 ab\n1 3 a\n1 4 b\n2 1 4 ab\n" ], "output": [ "1\n3\n2\n" ] }	{"input":["3 4\n3 2 1\n","5 97\n1 10 76 97 2\n","2 16\n12 4\n","2 100\n132 1\n","5 76\n1 10 50 100 2(...TRUNCATED)	1	11	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include<(...TRUNCATED)	{"language":[2,2,0,0,0,3,2,2,0,4,0,1,2,0,3,1,0,2,0,2,2,2,4,2,0,0,0,4,2,0,2,0,2,0,2,4,3,0,3,2,3,4,0,0(...TRUNCATED)	0	G	0	2,700	[ "data structures", "greedy", "two pointers" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
920_E. Connected Components?	"You are given an array a of n integers.\n\nYou want to make all elements of a equal to zero by doin(...TRUNCATED)	{ "input": [ "3\n2\n<>\n3\n><<\n1\n>\n" ], "output": [ "0\n0\n0\n" ] }	{"input":["1 1\nt\n+ 2 p\n","2 12\naa\n+ 1 a\n+ 2 a\n+ 3 a\n- 1\n+ 1 a\n- 2\n+ 2 a\n- 3\n+ 3 a\n+ 2 (...TRUNCATED)	{"input":["4\nRBRR","4\nBBRR","4\nRRCR","4\nRRAR","4\nRARR","4\nBQBR","4\nRCRR","4\nBPBR","4\nRRRC",(...TRUNCATED)	2	0	{"language":[2,2,2,2,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,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,4,3,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,4,2,2,2,2,2,2,2(...TRUNCATED)	0	B	0	900	[ "data structures", "implementation" ]	false		null	256,000,000
105_C. Item World	"Everybody knows that we have been living in the Matrix for a long time. And in the new seventh Matr(...TRUNCATED)	{ "input": [ "aabb\n", "aabcaa\n" ], "output": [ "2\n", "1\n" ] }	{"input":["143165576\n","1919020031\n","1204252996\n","210637432\n","724264821\n","1741\n","61948959(...TRUNCATED)	{"input":["3\nDSAWWAW\nD\nAW\n","3\nWSAWDAW\nD\nAW\n","3\nDAAWWSW\nD\nAW\n","3\nWAWWASD\nD\nWA\n","3(...TRUNCATED)	2	7	{"language":[2,2,2,2,4,2,2,4,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,2,2,0,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(...TRUNCATED)	1,297	E	1,250	2,100	[ "dfs and similar", "graphs" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
colarr	"In the previous problem Chandu bought some unsorted arrays and sorted them (in non-increasing order(...TRUNCATED)	{"input":["3\n4 2\nabca\n1 3\n10 5\ncodeforces\n2 8 3 2 9\n26 10\nqwertyuioplkjhgfdsazxcvbnm\n20 10 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 3 2 1\n2 4 2 3\n","4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 (...TRUNCATED)	2	9	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2],"solution":["#include<cmath>\n#include<queue>\(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2,4,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,3,2(...TRUNCATED)	536	A	0	1,600	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
483_B. Friends and Presents	"4 different points on the plane Read the coordinates of $ A (x_a, y_a) $, $ B (x_b, y_b) $, $ C (x_(...TRUNCATED)	{"input":["15 22\n8 13 33418\n14 15 55849\n7 10 15207\n4 6 64328\n6 9 86902\n15 7 46978\n8 14 53526\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["0 1681261333\n","10 4\n","16384 40642166\n","727373493 403495785\n","62914844 907959152\n(...TRUNCATED)	2	10	{"language":[2,4,1,2,2,2,4,4,2,2,4,4,2,2,2,2,2,2,2,2,3,2,4,1,2,2,2,2,2,2,2,1,2,2,2,1,4,2,3,2,2,2,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	820		1,000	2,300	[ "binary search", "data structures", "hashing" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1176_F. Destroy it!	"This is the easier version of the problem. In this version 1 ≤ n, m ≤ 100. You can hack this pr(...TRUNCATED)	{"input":["9 4 12\nthis is a sample text for croc final round\n","9 1 9\nthis is a sample text for c(...TRUNCATED)	{"input":["1 1\na\n10\n","1 20\naaaaaaaaaaaaaaaaaaaa\n924705 786913 546594 427698 741583 189683 3540(...TRUNCATED)	{"input":["30 35 4 30\n14 2 7\n22 23 4\n5 26 3\n28 4 3\n7 5 29\n19 15 2\n11 20 12\n1 22 9\n30 21 24\(...TRUNCATED)	2	0	{"language":[2,2,4,2,2,2,3,3,4,3,2,3,3,3,2,2,3,4,2,2,3,4,3,3,2,3,2,3,2,3,4,3,3,2,3,3,2,4,2,2,2,4,3,2(...TRUNCATED)	{"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)	1,344	D	0	2,700	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1170_E. Sliding Doors	"Takahashi is locked within a building.\n\nThis building consists of H×W rooms, arranged in H rows (...TRUNCATED)	{"input":["2 3\n1 2\n1 2\n1 2\n","5 7\n2 4\n5 1\n2 3\n3 4\n4 1\n5 3\n3 5\n"],"output":["5 6 ","10 9 (...TRUNCATED)	{"input":["5\n27468 7465 74275 40573 40155\n112071 76270 244461 264202 132397\n1 777133331\n2 107454(...TRUNCATED)	{"input":["7 6\nalloc 2\nalloc 2\nalloc 3\nerase 1\ndefragment\nerase 3\nalloc 4\n","8 50\nalloc 51\(...TRUNCATED)	2	8	{"language":[2,3,4,3,2,2,3,3,1,2,4,4,2,2,2,4,4,4,1,2,4,3,2,2,3,4,3,3,2,3,4,2,2,3,2,1,3,2,4,4,3,4,4,1(...TRUNCATED)	{ "language": [], "solution": [] }	7	B	0	1,800	[]	false		null	134,217,728
1060_A. Phone Numbers	"Programmers' kids solve this riddle in 5-10 minutes. How fast can you do it?\n\nInput\n\nThe input (...TRUNCATED)	{"input":["6\n1 4 3 3 5 7\n3 7 5 4 3\n4 3 7 5\n","5\n1 5 8 123 7\n123 7 5 1\n5 1 7\n"],"output":["1\(...TRUNCATED)	{"input":["4\n3 4\n1 2\n3 4\n1 2\n","4\n2 4\n1 3\n4 4\n1 1\n","10\n6 6\n1 2\n2 2\n6 7\n8 8\n3 5\n5 5(...TRUNCATED)	{"input":["3 2\n1 2 5\n","3 10\n5 3 10\n","3 4\n0 2 5\n","1 100\n5\n","7 20\n2 15 12 11 20 19 12\n",(...TRUNCATED)	5	7	{"language":[2,3,4,2,2,3,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,2,2,3,2,2,2,3,2,3,2,3,4,1,2,3(...TRUNCATED)	{"language":[2,2,4,4,4,4,2,3,3,3,3,3,3,3,3,2,3,2,4,3,1,4,2,2,2,3,2,4,4,2,3,3,4,2,2,3,1,3,2,4,4,4,3,2(...TRUNCATED)	1,037	C	0	1,500	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000