Datasets:

TheFactoryX
/

edition_0659_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
331_E2. Deja Vu	"Recenlty Luba got a credit card and started to use it. Let's consider n consecutive days Luba uses (...TRUNCATED)	{"input":["1\n1\n","2\n1 2\n3 4\n","4\n5 7 8 4\n9 5 3 2\n1 6 6 4\n9 5 7 3\n"],"output":["0\n","2\n",(...TRUNCATED)	{"input":["20 20\n00010110100100010111\n11110000001100101110\n01110101110001111000\n1011110100011111(...TRUNCATED)	{"input":["5\n12\n5 4 4 3 2 2 1 1 1 1 1 1\n4\n4 3 2 1\n1\n1000000\n20\n20 19 18 17 16 15 14 13 12 11(...TRUNCATED)	2	12	{"language":[2,3,3,2,4,1,3,2,4,2,2,3,2,3,4,4,3,3,3,4,2,3,3,2,2,3,4,2,3,2,4,3,4,2,3,4,2,2,3,2,4,4,2,3(...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],"solution":["#include <bits/stdc++.h(...TRUNCATED)	1,325		0	1,100	[ "" ]	false	null	256,000,000
p00490 Best Pizza	"Polycarp plays a well-known computer game (we won't mention its name). Every object in this game co(...TRUNCATED)	{"input":["3\n-1 -1\n1 0\n2 0\n2\n1 1 3\n2 1 3\n","3\n-1 -1\n1 0\n1 1\n2\n2 2 3\n2 3 2\n"],"output":(...TRUNCATED)	{ "input": [ "1\n1\n1\n1\n1 1 1 1\n" ], "output": [ "1\n" ] }	{"input":["50\n16 4\n17 9\n31 19\n3 10\n8 1\n40 30\n3 31\n20 29\n47 27\n22 25\n32 34\n12 15\n40 32\n(...TRUNCATED)	2	10	{"language":[1,3,3,3,2,4,4,3,4,3,2,4,2,3,3,4,3,2,4,1,3,3,4,4,4,4,3,2,2,1,3,1,3,1,4,1,3,3,2,3,4,3,4,1(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,2,1,4,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,4,2,2,2(...TRUNCATED)	746		0	2,200	[ "brute force", "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1525_D. Armchairs	"Joisino is planning to open a shop in a shopping street.\n\nEach of the five weekdays is divided in(...TRUNCATED)	{ "input": [ "3\n25\n46\n99" ], "output": [ "2\n1\n2\n" ] }	{"input":["100\n591 417 888 251 792 847 685 3 182 461 102 348 555 956 771 901 712 878 580 631 342 33(...TRUNCATED)	{"input":["1\n1 0 1 1\n10000 10000 10000 10000","2\n10 3 1 2\n2 4 1 3\n1 2 1 1","2\n10 3 1 2\n2 4 1 (...TRUNCATED)	6	0	{"language":[2,2,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,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,4,2,3,2,2,1,2,4,2,2,2,3,2,4,2,2,2,4,4,1,4,4,1,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,4,1(...TRUNCATED)	203		0	0	[ "" ]	false	{ "nanos": 0, "seconds": 8 }	512,000,000
925_E. May Holidays	"Your math teacher gave you the following problem:\n\nThere are n segments on the x-axis, [l_1; r_1](...TRUNCATED)	{"input":["5 6 5\n5 4 86\n5 1 0\n1 3 38\n2 1 33\n2 4 28\n2 3 40\n3 5\n2 6\n1 3\n2 3\n1 6\n"],"output(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["30\n16 3\n-334 -500 -169 -724 -478 -358 -962 -464 -705 -145 -281 -827 -961 -491 -995 -942(...TRUNCATED)	2	8	{"language":[2,4,4,2,3,4,4,4,4,2,2,3,4,3,3,3,3,3,4,2,2,4,3,3,4,3,2,3,4,2,3,3,2,3,3,4,3,3,2,2,3,4,3,2(...TRUNCATED)	{"language":[2,2,2,2,2,4,3,3,2,4,2,2,2,2,2,2,2,2,2,4,2,3,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,4,2,2,3,2,2,2(...TRUNCATED)	1,328	C	0	2,900	[ "" ]	false	null	268,435,456
512_B. Fox And Jumping	"Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is ex(...TRUNCATED)	{ "input": [ "4\n1 14\n1 50\n4 28\n5 700\n\nSAMPLE" ], "output": [ "1\n10\n3\n32491" ] }	{"input":["10 10\n.L.....R..\n.........U\n..D....D..\n.R......L.\n....L.....\n.........D\n......U...(...TRUNCATED)	{"input":["1 1\n5\n2 1 7\n","10 6\n10 10 10 6 6 5 5 5 3 1\n2 3 50\n2 4 10\n1 3 10\n2 2 36\n1 4 7\n2 (...TRUNCATED)	2	2	{"language":[3,1,1,2,2,4,2,3,4,2,3,4,1,4,1,3,3,2,1,3,3,3,3,2,4,4,2,4,2,4,4,2,4,4,3,3,3,2,4,2,2,4,4,1(...TRUNCATED)	{"language":[2,3,2,4,4,1,4,2,3,4,2,2,4,2,2,4,1,2,2,4,3,2,4,2,3,1,4,4,4,2,1,3,1,2,2,4,3,2,2,2,4,1,2,2(...TRUNCATED)	556	B	1,000	1,500	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
478_A. Initial Bet	"Polycarp plays a well-known computer game (we won't mention its name). In this game, he can craft t(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["51 89 97\n18 25 63\n22 91 74\n","1 100 1\n100 100 100\n1 100 100\n","20 1 1\n100 100 100\(...TRUNCATED)	{"input":["4\n3\n1 4 2\n1 3 1\n2\n2 4\n2 3\n2\n1 1100000000\n1 1000000000\n4\n3 10 5 8\n2 5 2 4\n","(...TRUNCATED)	6	10	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	{"language":[2,2,2,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,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	C	0	0	[ "brute force", "math", "number theory" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
7_B. Memory Manager	"Chef has a an array A consisting of N elements. He wants to add some elements into the array as per(...TRUNCATED)	{"input":["1\n0\n","6\n2 0 3 0 1 1\n","6\n3 2 2 2 1 1\n"],"output":["0\n\n","5\n6 6\n5 5\n4 3\n4 5\n(...TRUNCATED)	{"input":["4\n39 20\n183 11\n551 27\n85 16","8\n4 65\n5 12\n7 24\n9 38\n12 24\n14 10\n65 75\n31 26"](...TRUNCATED)	{"input":["8 9\n6 -1 5 -5 -1 -7 -8 -7\n","10 7\n-9 3 -4 -22 4 -17 1 -14 3 -2\n","5 10\n-8 -24 0 -5 1(...TRUNCATED)	3	0	{"language":[2,2,2,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,2,2,2(...TRUNCATED)	{"language":[4,2,4,2,2,2,2,2,2,1,4,2,2,2,2,1,4,2,2,3,2,2,2,2,2,2,4,2,2,2,1,2,1,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	789	C	0	0	[]	false	{ "nanos": 500000000, "seconds": 0 }	256,000,000
p00781 Lattice Practices	"Programmers' kids solve this riddle in 5-10 minutes. How fast can you do it?\n\nInput\n\nThe input (...TRUNCATED)	{"input":["5\n4 5\n10 8 6 4\n1 2 3 4 5\n1 1\n3\n3\n1 1\n3\n2\n5 3\n1000 2 2 2 3\n3 1 5\n5 5\n1 2 3 4(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["20\n76 86 70 7 16 24 10 62 26 29 40 65 87 49 34 55 92 47 43 100\n","100\n6591 1074 3466 3(...TRUNCATED)	2	0	{"language":[4,4,4,2,2,2,4,2,2,4,4,2,2,2,2,4,2,2,4,4,2,2,2,4,4,2,2,2,2,2,4,4,4,4,4,4,4,4,2,2,4,4,4,4(...TRUNCATED)	{ "language": [], "solution": [] }	915	B	0	1,300	[ "brute force", "greedy" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
949_C. Data Center Maintenance	"Awruk is taking part in elections in his school. It is the final round. He has only one opponent (...TRUNCATED)	{ "input": [ "3\n2 3\n3 6\n1 2\n3\n2 3\n3 5\n1 2\n0" ], "output": [ "Yes\nNo" ] }	{ "input": [], "output": [] }	{"input":["1\n47 1 47\n40 45 19 10 44 33 47 12 2 46 16 23 3 14 21 28 31 42 22 18 35 38 24 25 36 32 4(...TRUNCATED)	2	10	{ "language": [], "solution": [] }	{"language":[2,2,2,2,4,2,2,1,2,1,2,2,4,1,4,2,2,2,1,2,2,2,2,4,4,2,2,2,4,1,4,2,2,2,2,2,2,4,2,3,1,1,3,2(...TRUNCATED)	0	B	1,000	900	[ "games", "math" ]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
675_E. Trains and Statistic	"Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.\n(...TRUNCATED)	{"input":["3 10 10\n1\n1 1 1\n1\n3 3 3\n1\n5 5 5\n0 1 0\n1 0 0\n0 1 0","4 59 40\n1\n7 6 3\n1\n10 3 9(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1500 1572 1600 3 2","1500 2445 500 90000 100000","1500 2000 1615 3 2","1500 1572 1600 0 2(...TRUNCATED)	2	0	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	{"language":[2,1,2,2,3,2,2,2,2,2,2,3,3,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,3,0,2,2,2,2(...TRUNCATED)	405		500	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000