Datasets:

TheFactoryX
/

edition_1053_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
235_D. Graph Game	"Bosky is a very curious child who turned 13 yesterday. His parents gifted him a digital watch which(...TRUNCATED)	{"input":["3\n2\n1 5 10\n2 15 5\n3\n2 93 78\n1 71 59\n3 57 96\n19\n19 23 16\n5 90 13\n12 85 70\n19 6(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n7 7 3 5\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 5\n4 5 2 4\n1 2\n2 3\n3 4\n4 1\n4 2\n4 3 2 1\(...TRUNCATED)	2	12	{"language":[2,3,3,2,3,3,3,3,3,4,4,4,3,3,1,3,4,4,4,4,3,1,3,4,2,4,3,4,3,3,1,1,4,3,2,4,3,2,4,3,3,3,3,3(...TRUNCATED)	{"language":[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,3,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	C	500	2,200	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p03407 AtCoder Beginner Contest 091 - Two Coins	"Nathan O. Davis is a student at the department of integrated systems. Today he learned digital quan(...TRUNCATED)	{"input":["7 6 6\n3 2\n1 7\n5 7\n3 7\n6 4\n8 9\n8 5\n","5 2 2\n1 1\n4 1\n2 3\n3 2\n3 4\n"],"output":(...TRUNCATED)	{"input":["0 1073741823\n","10 5\n","16384 36739846\n","727373493 346368330\n","62914844 1044381411\(...TRUNCATED)	{"input":["3 1\n-1 3\n-2 -2\n","-8360 9282\n2666 2344\n9109 -2730\n","0 45\n42 -47\n-51 -42\n","45 6(...TRUNCATED)	2	8	{"language":[3,2,4,2,2,2,3,3,3,4,3,3,3,2,4,3,2,4,2,3,2,2,3,2,2,4,2,2,3,3,4,3,3,2,2,2,4,3,3,3,3,3,2,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)	949	I	1,750	1,300	[ "brute force" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
776_A. A Serial Killer	"Treeland consists of n cities and n-1 two-way roads connecting pairs of cities. From every city, yo(...TRUNCATED)	{"input":["5 10\n50 40 30 20 10\n10\n20\n30\n40\n50\n60\n70\n80\n90\n100\n\nSAMPLE"],"output":["YES\(...TRUNCATED)	{"input":["1 0\n1 1 0\n1 446844829 77109657 780837560\n1 754808995 539371459\n","1 1\n1 1\n2 2 0\n1 (...TRUNCATED)	{"input":["1\n2\n111 2\n115 112\n","10\n5\n88 60\n10 3\n48 21\n90 70\n40 88\n5\n20 81\n39 98\n34 87\(...TRUNCATED)	2	3	{"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,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)	331		0	1,100	[]	true		{ "nanos": 0, "seconds": 1 }	256,000,000
593_C. Beautiful Function	"Everything got unclear to us in a far away constellation Tau Ceti. Specifically, the Taucetians cho(...TRUNCATED)	{ "input": [ "2\nacxz\nbcxz\n\nSAMPLE" ], "output": [ "Funny\nNot Funny\n" ] }	{ "input": [], "output": [] }	{"input":["3\n2\n46\n99","3\n0\n7\n61","3\n25\n46\n24","3\n2\n60\n99","3\n0\n8\n24","3\n25\n46\n35",(...TRUNCATED)	2	0	{"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,2,2,2,3,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	F	250	2,000	[ "*special", "binary search", "constructive algorithms", "interactive" ]	false		{ "nanos": 0, "seconds": 2 }	1,073,741,824
343_B. Alternating Current	"problem\n\nIf you write a positive integer in decimal notation (without leading 0) and look at the (...TRUNCATED)	{ "input": [ "3\n3 2 2\n", "4\n2 2 2 2\n" ], "output": [ "4\n", "3\n" ] }	{ "input": [], "output": [] }	{"input":["12 11\n11 12\n25 7\n","12 17\n6 19\n13 16\n","9 12\n3 17\n10 20\n","2 4\n1 3\n3 3\n","3 7(...TRUNCATED)	2	10	{"language":[2,2,2,2,2],"solution":["#include<cmath>\n#include<cstdio>\n#include<vector>\n\n#define (...TRUNCATED)	{ "language": [], "solution": [] }	0	C	0	2,200	[ "implementation" ]	false	"機械に辺・対角線の長さのデータを入力し、プラスティック板の型抜きを(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
1227_A. Math Problem	"There are N stations in the city where JOI lives, and they are numbered 1, 2, ..., and N, respectiv(...TRUNCATED)	{"input":["4\n1 3\n2 4\n3 4\n2 3\n","4\n4 4\n1 3\n2 4\n3 4\n"],"output":["NO\n1 3 4 2\n1 2 4 3\n","Y(...TRUNCATED)	{"input":["30\n16 3\n-334 -500 -169 -724 -478 -358 -962 -464 -705 -145 -281 -827 -961 -491 -995 -942(...TRUNCATED)	{"input":["1\n3 1 2\n","1\n25 30 500\n","1\n5 4 7\n","3\n2 1 3\n3 4 6\n99995 9998900031 9998900031\n(...TRUNCATED)	2	8	{"language":[2,4,2,2,2,2,2,2,2,3,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,2,2,2(...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)	0	A	2,500	2,800	[ "" ]	false		null	64,000,000
415_E. Mashmokh and Reverse Operation	"You are running through a rectangular field. This field can be represented as a matrix with 3 rows (...TRUNCATED)	{ "input": [ "3 4\n0110\n1010\n0111\n" ], "output": [ "2\n" ] }	{"input":["2\n1 2\n","100\n61 96 25 10 50 71 38 77 76 75 59 100 89 66 6 99 2 13 3 23 91 93 22 92 4 8(...TRUNCATED)	{"input":["9 1004498469 6\n","1 0 10\n","1944219055 33463955 1369298327\n","914835 4386500 9234739\n(...TRUNCATED)	2	11	{"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,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,1,2,2,4,2,2,2,2,4,4,4,2,2,2,3,2,4,2(...TRUNCATED)	1,354		0	900	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1264_A. Beautiful Regional Contest	"For a given polygon g, print \"1\" if g is a convex polygon, \"0\" otherwise. Here, in a convex pol(...TRUNCATED)	{"input":["byebye","abcdefghijklmnopqrstuvwxyz","aabxyyzz","abcabcxabcx"],"output":["1","26","2","3"(...TRUNCATED)	{ "input": [], "output": [] }	{"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)	2	0	{"language":[3,3,2,3,2,4,4,1,4,3,3,3,3,2,3,3,3,4,1,3,2,3,4,3,2,3,3,3,2,4,4,2,2,2,2,3,2,3,4,2,4,2,2,2(...TRUNCATED)	{"language":[2,4,2,4,2,0,3,2,0,2,4,2,3,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace s(...TRUNCATED)	0	E	0	2,600	[ "data structures", "dfs and similar", "dp", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p02916 AtCoder Beginner Contest 140 - Buffet	"Takahashi is locked within a building.\n\nThis building consists of H×W rooms, arranged in H rows (...TRUNCATED)	{ "input": [ "7\nabacaba\n", "6\naabcfg\n" ], "output": [ "YES\n2 3\n", "NO\n" ] }	{ "input": [ "1 1 2 1 1\n2 1\n" ], "output": [ "0\n" ] }	{"input":["1 10\n8\n1\n2\n3\n4\n5\n6\n7\n13\n9\n16\n","1 10\n2\n1\n2\n3\n4\n5\n6\n7\n8\n3\n16\n","1 (...TRUNCATED)	2	0	{"language":[1],"solution":["#Manage maximum events given start date and duration for a case\ndef ma(...TRUNCATED)	{"language":[2,2,2,2,2,3,2,2,3,2,2,2,2,4,3,3,2,4,2,2,2,2,4,2,3,4,2,2,2,2,2,2,4,2,2,2,2,2,3,2,2,2,2,2(...TRUNCATED)	1,216	C	0	1,800	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
p02744 Panasonic Programming Contest 2020 - String Equivalence	"There are n points on a coordinate axis OX. The i-th point is located at the integer point x_i and (...TRUNCATED)	{"input":["5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n1 1\n5 2\n6 3","4\n1 5\n4 7\n2 1\n6 4","10\n1375710043 178537096\n705445072 318106937\(...TRUNCATED)	2	10	{"language":[4,2,3,3,4,2,4,4,2,2,2,3,1,2,4,2,3,4,3,2,3,3,3,3,3,2,3,3,3,2,4,4,2,3,3,2,4,3,2,3,3,2,4,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,0,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)	0	F	0	800	[ "data structures", "implementation" ]	true		null	256,000,000