Datasets:

TheFactoryX
/

edition_2358_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
p03150 KEYENCE Programming Contest 2019 - KEYENCE String	"Polycarp has n coins, the value of the i-th coin is a_i. It is guaranteed that all the values are i(...TRUNCATED)	{ "input": [ "10 30 10\n", "2 6 3\n", "5 20 11\n" ], "output": [ "85932500\n", "124780545\n", "1\n" ] }	{"input":["30 35 4 30\n14 2 7\n22 23 2\n5 26 3\n28 4 3\n7 5 29\n19 15 2\n11 20 12\n1 22 9\n30 21 24\(...TRUNCATED)	{"input":["+--+-+\n","+--+--+------+++++++-+-+++--++---+--+-+---+--+++-+++-------+++++-+-++++--+-+-+(...TRUNCATED)	2	0	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,4,4,4,2,2,3,2,4,4,4,2,2,2,2,2,2,2,2,4,3,2,4,4,2,2,4,4,3,2,4,2,4,3,2,2,4,4,2,2,2,4,2,2(...TRUNCATED)	0		2,750	800	[ "" ]	false	"太郎君はかけざんを習いたての小学生です。なんとなく、彼はかけざんを(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
p00676 KND is So Sexy	"Problem Statement\n\nYou are given a list of $N$ intervals. The $i$-th interval is $[l_i, r_i)$, wh(...TRUNCATED)	{"input":["5\n1 2\n2 1\n5 10\n10 9\n20 1\n","5\n1 2\n2 1\n5 10\n10 9\n19 1\n"],"output":["4\n","3\n"(...TRUNCATED)	{"input":["3\n121339 121339 121339 55451923 531222142 121339 121339 435485671 121339\n","3\n1 7 9232(...TRUNCATED)	{"input":["9\n3 9 7 6 9 7 8 9\n","4\n3 4 4\n","8\n3 5 7 8 8 7 8\n","8\n3 8 7 8 8 7 8\n","7\n7 3 4 7 (...TRUNCATED)	5	7	{"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],"solution":["a,b=raw_input().spl(...TRUNCATED)	{"language":[2,0,2,3,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,0,2,2,2,2,2,3,2,2,2,2,2,2,2,3,2,2,2,2,2,2(...TRUNCATED)	737		0	0	[ "dfs and similar", "graphs" ]	false		{ "nanos": 0, "seconds": 1 }	134,217,728
152_E. Garden	"There are N slimes standing on a number line. The i-th slime from the left is at position x_i.\n\nI(...TRUNCATED)	{ "input": [ "2\n5 10\n3 4 6 1 9\n3 2\n1 3 4" ], "output": [ "1\n0" ] }	{"input":["10\n5 1 33242121\n5 7 535463871\n9 1 202863787\n5 4 874413088\n6 1 623012241\n6 8 7866591(...TRUNCATED)	{"input":["3\n3 3\n1 -3 4\n1 5 2\n2 2\n-4 0\n1 2\n2 2\n0 1\n1 2\n","3\n3 3\n1 -3 4\n1 5 2\n2 2\n-2 0(...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":[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)	0	E	0	0	[ "data structures" ]	false		{ "nanos": 0, "seconds": 5 }	512,000,000
295_D. Greg and Caves	"A tree is a connected graph without cycles.\n\nTwo trees, consisting of n vertices each, are called(...TRUNCATED)	{"input":["5 7\nqcezchs\nhhedywq\nwikywqy\nqckrqzt\nbqexcxz\n3 2\n??\nyw\n?q\n","8 6\nibrgxl\nxqdcsg(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["605 297 -440074875 -366763764 -445828791 325081312\n","14 9 44 1 -50 -9\n","16 17 -260784(...TRUNCATED)	2	6	{"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],"solution":["#include <bits/stdc(...TRUNCATED)	{"language":[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,2,2,2,2,2(...TRUNCATED)	167	B	0	0	[ "greedy" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
p03297 AtCoder Grand Contest 026 - rng_10s	"You have a string s — a sequence of commands for your toy robot. The robot is placed in some cell(...TRUNCATED)	{ "input": [ "2\n2 6\n10 11" ], "output": [ "2\n1\n" ] }	{ "input": [], "output": [] }	{"input":["10\n4643665 282618243 791521863 214307200 976959598 590907019 166397456 708291256 8537738(...TRUNCATED)	2	8	{"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,4,2,2,2,2(...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)	1,547		1,000	1,500	[ "number theory" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
25_D. Roads not only in Berland	"We have a sandglass consisting of two bulbs, bulb A and bulb B. These bulbs contain some amount of (...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":["4\n1 1 1 1 1 1 1 1 1 1 1 1 3 3 6 3\n","1\n53\n","1\n77\n","1\n20\n","1\n10\n","1\n11\n","(...TRUNCATED)	6	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,1,2,4,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[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>\nusing n(...TRUNCATED)	855	D2	1,500	3,100	[ "*special" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
675_E. Trains and Statistic	Example Input 4 3 1 3 4 7 Output 6	{"input":["5 2 4 13\nhhwhh\n","3 1 100 10\nwhw\n","5 2 4 1000\nhhwhh\n","4 2 3 10\nwwhw\n"],"output"(...TRUNCATED)	{"input":["16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 12\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 1(...TRUNCATED)	{"input":["11\n7\n8\n9\n10\n11\n12\n13\n14\n27\n16\n17","11\n7\n8\n9\n10\n11\n22\n13\n2\n27\n8\n17",(...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": [], "solution": [] }	235	A	0	2,400	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1189_D1. Add on a Tree	"Problem description.\nVipul is a hardworking super-hero who maintains the bracket ratio of all the (...TRUNCATED)	{"input":["9 10\n1 2 3 4 5 6 7 8 9\n1 2\n2 3\n2 4\n3 4\n4 5\n4 6\n2 7\n7 8\n7 9\n9 1","2 1\n1 2\n1 2(...TRUNCATED)	{"input":["4\n1 2 4 3\n","4\n2 1 4 3\n","10\n1 2 10 9 7 4 8 3 6 5\n","10\n1 7 10 6 5 2 3 8 9 4\n","4(...TRUNCATED)	{"input":["4 1 1 12\n3 2 3","4 1 1 16\n3 2 3","4 1 1 16\n2 2 3","4 1 1 6\n3 1 3","4 0 1 12\n3 2 3","(...TRUNCATED)	2	9	{"language":[2,2,3,3,1,3,4,3,2,2,4,3,2,4,2,4,4,4,3,3,2,4,3,2,2,2,3,2,3,4,2,3,2,2,4,4,3,3,2,3,4,3,3,2(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,4,2,4,2,2,2,2,2,4,4,2,4,2,4,2,2,2,2,2,2,4(...TRUNCATED)	0		2,750	0	[ "*special" ]	false		null	256,000,000
p02610 AIsing Programming Contest 2020 - Camel Train	"Bearland is a dangerous place. Limak can’t travel on foot. Instead, he has k magic teleportation (...TRUNCATED)	{ "input": [ "6\n1 2 3 4 5 6\n", "10\n10 9 7 8 6 5 3 4 2 1\n" ], "output": [ "0\n", "2\n" ] }	{ "input": [], "output": [] }	{"input":["5\n3\n1\n1\n3\n4\n5\n\nSAMPLE","5\n3\n1\n3\n3\n4\n5\n\nSAMPLE","5\n4\n1\n1\n3\n5\n5\n\nSA(...TRUNCATED)	3	0	{"language":[4,2,3,3,2,4,4,2,4,2,4,3,3,3,2,4,3,2,4,2,3,2,4,2,4,4,3,3,3,4,3,4,2,4,3,3,4,4,4,2,3,4,3,2(...TRUNCATED)	{"language":[4,2,2,2,4,2,4,2,2,2,3,4,1,1,3,4,1,4,2,3,4,4,1,2,4,4,4,3,4,1,4,2,4,2,2,2,3,4,4,2,1,2,3,1(...TRUNCATED)	0	D	0	2,300	[ "" ]	false		{ "nanos": 0, "seconds": 5 }	256,000,000
348_A. Mafia	"Today Peter has got an additional homework for tomorrow. The teacher has given three integers to hi(...TRUNCATED)	{"input":["5 5 2\n#####\n#A#B#\n# #\n#b#a#\n#####\n16 4 3\n################\n## ########## ##\n# (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5 2 4 15\nhhhwh\n","2 8 5 1000000000\nwh\n","1 3 3 3\nw\n","10 2 3 32\nhwwhwhwwhh\n","7 1(...TRUNCATED)	2	0	{"language":[4,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,4,1(...TRUNCATED)	{"language":[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,2,2,2,2,2,2,2],"solution":[(...TRUNCATED)	996	C	0	1,700	[]	false		{ "nanos": 0, "seconds": 2 }	268,435,456