Datasets:

TheFactoryX
/

edition_1089_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
1264_A. Beautiful Regional Contest	"There are N people standing on the x-axis. Let the coordinate of Person i be x_i. For every i, x_i (...TRUNCATED)	{ "input": [ "7\nabacaba\n", "6\naabcfg\n" ], "output": [ "YES\n2 3\n", "NO\n" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	10	{"language":[2,2,3,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,4(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,3,3,2,3,3,4,2,2,3,2,3,2,2,2,2,2,2,2,3,2,4,2,4,1,2,4,3,2,4,4,2,2,3,4,2,2,2(...TRUNCATED)	0	H	1,000	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
405_E. Graph Cutting	"There were n types of swords in the theater basement which had been used during the plays. Moreover(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\n1 1 3 1\n3\n0 1 2\n"],"output":[" (...TRUNCATED)	{"input":["3 10 10\n1\n1 1 1\n1\n3 3 3\n1\n5 5 5\n0 1 1\n1 0 0\n0 1 0","1 10 3\n3\n1 10 1\n2 20 2\n3(...TRUNCATED)	5	8	{"language":[1,1,1,1],"solution":["t=int(raw_input())\ndef z(x):\n i=5\n c=0\n while x/i>=1(...TRUNCATED)	{"language":[0,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\ntypedef struct {\n dou(...TRUNCATED)	0		0	3,000	[ "implementation" ]	false		null	256,000,000
1189_A. Keanu Reeves	"In 20XX, the Aizu Chuo Road, which has a total distance of 58km and 6 sections from Atsushiokanomac(...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":["4 1\n7 6 1 1\n3\n3\n2 1 9\n2 1 10\n2 1 6\n","5 1\n8 4 8 7 3\n9\n5\n2 1 3\n1 5 1\n2 1 8\n2(...TRUNCATED)	{"input":["1 1 1\n\n0\n\n0\n\n2344\n\n0\n\n0\n\n0\n","1 1 1\n\n0\n\n0\n\n0\n\n0\n\n0\n\n1\n","4 3 2\(...TRUNCATED)	5	0	{"language":[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,2,2,1,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,170		2,500	2,900	[ "constructive algorithms", "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1455_F. String and Operations	"4 different points on the plane Read the coordinates of $ A (x_a, y_a) $, $ B (x_b, y_b) $, $ C (x_(...TRUNCATED)	{ "input": [ "5 5 10\n1 2 4 8 16\n", "3 4 11\n1 2 3 4\n" ], "output": [ "7\n", "6\n" ] }	{"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": [], "output": [] }	2	8	{"language":[2,4,3,3,3,2,2,4,3,3,3,3,3,2,4,3,4,4,3,3,3,3,3,4,2,4,1,4,3,2,1,3,4,3,3,2,3,3,2,4,3,3,3,3(...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		1,750	1,800	[ "implementation", "strings" ]	false	"20XX年に喜多方市熱塩加納町から南会津町までの6区間、総距離58kmの会津中(...TRUNCATED)	{ "nanos": 500000000, "seconds": 1 }	512,000,000
roy-and-wobbly-numbers	"Long long ago, there was a thief. Looking for treasures, he was running about all over the world. O(...TRUNCATED)	{"input":["3 2\n1 2\n2 3\n","3 3\n1 2\n2 3\n3 1\n","8 12\n1 2\n2 3\n3 4\n4 1\n1 3\n2 4\n3 5\n3 6\n5 (...TRUNCATED)	{ "input": [ "1\n999838675\n" ], "output": [ "-1\n" ] }	{"input":["5 4","7 4","6 1","9 4","6 3","14 4","8 1","28 4","15 2","28 3","19 2","32 2","29 5","26 3(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2,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,2,2,2,4(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,3,2,1,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	512	D	500	1,100	[ "brute force", "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
even-from-end-1	"This is an interactive problem!\n\nEhab plays a game with Laggy. Ehab has 2 hidden integers (a,b). (...TRUNCATED)	{"input":["6 3\n3 1 2 3 2 3\n","10 1\n1 1 1 1 1 1 1 1 1 1\n","12 4\n1 2 3 1 2 3 4 1 2 1 2 1\n"],"out(...TRUNCATED)	{"input":["2 0\n","100000 0\n","8 9\n1 2\n2 3\n3 4\n4 1\n5 6\n6 7\n7 8\n8 5\n6 8\n","2 1\n1 2\n","11(...TRUNCATED)	{"input":["1\n2","1\n0","1\n-1","1\n-2","1\n-4","1\n-5","1\n-8","1\n-11","1\n3","1\n4","1\n6","1\n10(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2,2,3,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3(...TRUNCATED)	{"language":[2,2,4,4,4,4,2,2,2,2,2,2,2,3,2,4,3,3,2,2,2,2,2,2,2,2,2,4,4,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2(...TRUNCATED)	161	A	0	0	[ "greedy", "implementation" ]	false		null	134,217,728
luckybal	"Emily's birthday is next week and Jack has decided to buy a present for her. He knows she loves boo(...TRUNCATED)	{ "input": [ "3\n0 0 0\n", "5\n0 1 1 1 10\n", "2\n0 1\n" ], "output": [ "3 2 1 ", "1 4 3 2 5 ", "1 2 " ] }	{ "input": [ "2\nacxz\nbcxz" ], "output": [ "Funny\nNot Funny\n" ] }	{"input":["21\n11 19 4 19 6 0 13 7 6 2 5 3 16 16 1 9 15 21 9 21 2\n","100\n57 85 27 81 41 27 73 10 7(...TRUNCATED)	3	0	{"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,4,2,2,2,2,3,4,1,4,4,2,2,2,1,2,4,4,2,2,2,2,2,2,2,4,4,4,4,2,1,4,4,2,2,3,2,2,2,4,2(...TRUNCATED)	0	D1	1,000	2,600	[ "dfs and similar", "graphs", "hashing", "shortest paths" ]	false		{ "nanos": 500000000, "seconds": 0 }	256,000,000
223_C. Partial Sums	"Maga and Alex are good at string manipulation problems. Just now they have faced a problem related (...TRUNCATED)	{"input":["3 3\n1 3\n2 3\n3 3\n","3 1\n1 1\n2 2\n3 3\n","7 3\n1 7\n3 8\n4 5\n6 7\n1 3\n5 10\n8 9\n",(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["100 5\n1\n23\n45\n47\n89","10 2\n4\n1","4 1\n3","100 3\n1\n23\n45\n47\n89","100 0\n1\n23\(...TRUNCATED)	2	0	{"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":[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,239	A	0	1,400	[ "constructive algorithms", "dfs and similar", "dp", "greedy", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1236_A. Stones	"Little Chris is participating in a graph cutting contest. He's a pro. The time has come to test his(...TRUNCATED)	{ "input": [ "3\n25\n46\n99" ], "output": [ "2\n1\n2\n" ] }	{ "input": [], "output": [] }	{"input":["4 4","1 15","2 4","2 15","3 0","2 26","3 -1","2 32","0 -1","1 32","0 -2","1 17","-1 -2","(...TRUNCATED)	2	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":[0,0,0,0,2,0,2,0,2,2,2,1,2,4,2,2,1,4,2,2,0,2,0,4,2,0,0,0,2,0,2,0,3,0,0,2,2,0,2,3,0,2,4,2(...TRUNCATED)	494		0	0	[ "data structures", "dfs and similar", "dp", "trees" ]	false		null	256,000,000
stadium	"Two coordinates (a1, a2) and (b1, b2) on a two-dimensional grid of r × c are given. The cost of mo(...TRUNCATED)	{ "input": [ "3 5\n1 2 3\n1 3 2 3 1\n" ], "output": [ "12\n" ] }	{"input":["100 1 7\n83\n174\n191\n145\n167\n55\n232\n157\n51\n209\n85\n73\n216\n39\n72\n76\n132\n70\(...TRUNCATED)	{"input":["2\n\nSBMPLE","2\n\nSBPMLE","2\n\nELMPBS","2\n\nELMPAS","2\n\nSAPMLE","2\n\nSAQMLE","2\n\n(...TRUNCATED)	2	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],"solut(...TRUNCATED)	{"language":[0,0,0,0,2,0,0,2,2,1,1,0,2,4,0,2,0,0,0,0,0,0,2,2,0,0,0,2,2,2,3,2,2,2,1,3,4,2,0,2,2,0,2,2(...TRUNCATED)	915	C	0	0	[ "brute force", "greedy", "math" ]	false		{ "nanos": 0, "seconds": 1 }	1,073,741,824