Datasets:

TheFactoryX
/

edition_2535_deepmind-code_contests-readymade

name large_stringlengths 4 70	description large_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 large_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 large_stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
272_B. Dima and Sequence	One day Polycarpus stopped by a supermarket on his way home. It turns out that the supermarket is having a special offer for stools. The offer is as follows: if a customer's shopping cart contains at least one stool, the customer gets a 50% discount on the cheapest item in the cart (that is, it becomes two times cheape...	{ "input": [ "5 9\n10345\n23456\n34567\n45678\n56789\n", "2 10\n12\n43\n", "3 12\n1423\n6624\n6625\n" ], "output": [ "5", "1", "6" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	7	{ "language": [ 1 ], "solution": [ "T = int(raw_input())\nfor ti in xrange(T):\n\ta,b,c = map(int,raw_input().split())\n\tif a%3:\n\t\ts1 = 'X'\n\telse:\n\t\twhile a%3==0:\n\t\t\ta /= 3\n\t\tif a==1:\n\t\t\ts1 = 'K'\n\t\telse:\n\t\t\ts1 = 'X'\n\tif b%5:\n\t\ts2 = 'Y'\n\telse:\n\t\twhile b%5==0:\n\t\t\tb /...	{ "language": [], "solution": [] }	0		2,000	0	[ "" ]	true		{ "nanos": 0, "seconds": 2 }	134,217,728
70_C. Lucky Tickets	"Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings(...TRUNCATED)	{ "input": [ "4\n62 96 82 55\n\nSAMPLE" ], "output": [ "3 1 2 4\n" ] }	{"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":["1500 1572 1600 3 2","1500 2445 500 90000 100000","1500 2000 1615 3 2","1500 1572 1600 0 2(...TRUNCATED)	2	9	{"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,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,4,4,2,2,2,2,1,2,2,1,2,3,2,2,2,2,2,1,2,1,2,1,1,2,2,2,2,2,4,2,2,2,2,1,3,2,2,3,4,2,1,4,2(...TRUNCATED)	0	D2	2,500	0	[ "dp", "math", "number theory" ]	false		{ "nanos": 0, "seconds": 1 }	0
1065_F. Up and Down the Tree	"Vasya has a very beautiful country garden that can be represented as an n × m rectangular field di(...TRUNCATED)	{ "input": [ "8 2\n1 1 2 3 4 5 5\n", "7 1\n1 1 3 3 4 4\n" ], "output": [ "2", "4" ] }	{"input":["20 20\n00010110100100010111\n11110000001100101110\n01110101110001111000\n1011110100011111(...TRUNCATED)	{"input":["3\n2\n4\n10","3\n2\n6\n12","3\n4\n6\n12","3\n4\n6\n19","3\n2\n4\n19","3\n2\n3\n12","3\n4\(...TRUNCATED)	6	10	{"language":[1,1,1,1],"solution":["'''\n# Read input from stdin and provide input before running cod(...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,4(...TRUNCATED)	1,354	D	0	2,700	[ "brute force", "greedy" ]	false		{ "nanos": 0, "seconds": 6 }	256,000,000
p01353 Rabbit Plays Games!	"Problem\n\nTomorrow is finally the day of the excursion to Maizu Elementary School. Gatcho, who att(...TRUNCATED)	{ "input": [ "3 2 1\n1 2\n3\n", "10 8 2\n1 2 3 5 6 7 8 9\n3 5\n" ], "output": [ "-1", "2" ] }	{ "input": [], "output": [] }	{"input":["8 15\n","6 1\n","8 9\n","500 17172\n","5 2\n","5 9\n","2 7\n","3 15\n","61 249001\n","8 5(...TRUNCATED)	2	0	{"language":[3,4,2,3,4,4,3,3,3,4,4,2,4,4,3,3,4,1,2,3,3,2,4,2,4,4,2,2,2,2,4,2,2,4,4,4,3,2,4,4,3,4,2,4(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,1,4,2,2,2,2(...TRUNCATED)	551	A	0	1,400	[ "math", "number theory" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
palin-pairs	"You are given an array a_1, a_2, ... , a_n, which is sorted in non-decreasing order (a_i ≤ a_{i +(...TRUNCATED)	{ "input": [ "2 1\n1 2 2" ], "output": [ "1" ] }	{"input":["4\n6\na b c d\nA\nThomas a\nd d\ned edgars\nal Adams\n1\nTurnipHeadJohnson\n3\na a a a a (...TRUNCATED)	{"input":["20\n............./.\n","97\n.**..**..*....*..**..............(...TRUNCATED)	2	2	{"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":[4,2,4,3,2,2,3,4,2,4,3,3,3,4,2,2,4,3,4,2,2,2,3,4,2,2,2,2,4,3,4,2,2,4,2,2,4,3,2,3,4,2,2,2(...TRUNCATED)	0		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 4 }	256,000,000
188_G. Array Sorting	"The HR manager was disappointed again. The last applicant failed the interview the same way as 24 p(...TRUNCATED)	{ "input": [ "2\n3 1 1 5\n1 6 9\n3 2 6 7\n1 6 9" ], "output": [ "38\n36" ] }	{ "input": [], "output": [] }	{"input":["4\n6\na b c d\nA\nThomas a\nd d\ned edgars\nal Adams\n1\nTurnipHeadJohnson\n3\na a a a a (...TRUNCATED)	2	10	{"language":[4,1,4,3,3,3,3,4,3,2,3,2,3,3,3,3,4,3,2,3,3,2,2,2,2,2,3,4,3,4,2,1,4,3,2,2,2,3,2,4,3,2,3,3(...TRUNCATED)	{"language":[0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2],"solution":[(...TRUNCATED)	354	H	0	1,800	[ "*special" ]	false		{ "nanos": 0, "seconds": 1 }	0
p03013 AtCoder Beginner Contest 129 - Typical Stairs	"Once upon a time, there was a king who loved beautiful costumes very much. The king had a special c(...TRUNCATED)	{"input":["2\n3 1 9\n1 2 3\n1 1\n2 1\n3 1\n1 2\n2 2\n3 2\n1 3\n2 3\n3 3\n6 4 4\n6 5 4 3 1 2\n1 1\n3 (...TRUNCATED)	{"input":["1000\n999001\n999002\n999003\n999004\n999005\n999006\n999007\n999008\n999009\n999010\n999(...TRUNCATED)	{ "input": [], "output": [] }	2	12	{"language":[2,4,2,2,2,2,4,2,2,2,3,4,4,4,2,2,2,4,2,2,3,4,4,2,2,4,4,2,2,2,2,4,2,2,1,4,1,4,2,4,2,4,2,2(...TRUNCATED)	{"language":[2,4,3,1,2,4,1,2,1,3,1,2,3,1,4,4,2,4,4,2,3,3,3,1,1,3,1,4,2,4,3,4,3,2,4,2,2,2,1,4,1,3,3,4(...TRUNCATED)	0	B	0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	32,000,000
29_E. Quarrel	"This is the hard version of the problem. The difference between the versions is in the constraints (...TRUNCATED)	{ "input": [ "5 5\n1 2 3 4 5\n", "3 1\n1 1 2\n", "5 2\n1 1 2 1 3\n" ], "output": [ "16", "3", "14" ] }	{"input":["1 10\n778084 -205153\n778001 -205093\n778155 -205118\n778168 -204997\n778066 -205141\n778(...TRUNCATED)	{"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)	2	0	{"language":[2,2,2,3,2,2,4,2,2,3,2,2,2,2,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,2,2(...TRUNCATED)	{"language":[3,2,2,2,3,2,3,3,2,2,2,4,2,2,2,2,2,3,2,2,2,4,2,2,4,2,4,2,4,2,2,3,2,2,4,2,3,2,2,2,4,4,2,2(...TRUNCATED)	101	B	70	1,800	[ "dp" ]	false		null	134,217,728
laddu	"There are n cities in Berland and some pairs of them are connected by two-way roads. It is guarante(...TRUNCATED)	{ "input": [ "2\n3\n10" ], "output": [ "1\n3" ] }	{"input":["993 992 991\n","100 1 10\n","960 935 994\n","99 8 99\n","60 16 1\n","759 10 258\n","24 19(...TRUNCATED)	{"input":["1\n5 3\n200 12 9","1\n9 3\n200 12 9","1\n7 3\n200 12 9","1\n7 3\n141 12 9","1\n9 0\n141 1(...TRUNCATED)	5	9	{"language":[2,4,3,2,2,3,2,2,4,4,4,2,2,2,2,2,2,4,2,2,3,2,2,4,2,1,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,3,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,277	A	1,250	0	[ "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	0
p00206 Next Trip	"Hasan loves playing games and has recently discovered a game called TopScore. In this soccer-like g(...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": [], "output": [] }	{"input":["5\n5 4 3 1 2\n","3\n3 2 1\n","3\n2 3 1\n","10\n5 1 6 2 8 4 3 10 9 7\n","3\n3 1 2\n","3\n2(...TRUNCATED)	3	11	{"language":[2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2(...TRUNCATED)	{"language":[4,2,3,4,3,2,4,4,4,2,2,4,2,4,4,4,2,4,2,2,4,2,2,3,3,4,3,3,2,4,2,3,3,4,3,2,2,3,3,2,4,3,4,3(...TRUNCATED)	319	C	2,750	1,800	[ "math" ]	false	"機械に辺・対角線の長さのデータを入力し、プラスティック板の型抜きを(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000