Datasets:

TheFactoryX
/

edition_0391_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
vowel	"You are given an integer n. You have to apply m operations to it.\n\nIn a single operation, you mus(...TRUNCATED)	{"input":["24\n1 2 3 4\n1 2 4 3\n1 3 2 4\n1 3 4 2\n1 4 2 3\n1 4 3 2\n2 1 3 4\n2 1 4 3\n2 3 1 4\n2 3 (...TRUNCATED)	{"input":["10\n10\n8 10\n1 1\n1 6\n4 7\n4 9\n8 8\n1 4\n2 3\n4 5\n2 2\n10\n1 1\n1 2\n1 3\n1 4\n1 5\n6(...TRUNCATED)	{"input":["5\n2 1 1 1 2\n","6\n5 1 3 4 8 3\n","5\n1 5 7 1 2\n","6\n5 1 3 4 5 3\n","2\n1000010 100100(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2,4,4,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,4,3,2(...TRUNCATED)	{"language":[2,2,2,3,4,2,2,4,2,2,3,2,3,2,2,2,4,2,2,2,2,2,3,3,2,3,3,2,4,2,2,2,2,2,3,2,2,2,2,1,3,2,2,2(...TRUNCATED)	846		750	2,500	[ "brute force", "combinatorics", "dp", "string suffix structures" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
p03343 AtCoder Regular Contest 098 - Range Minimum Queries	"So the Beautiful Regional Contest (BeRC) has come to an end! n students took part in the contest. T(...TRUNCATED)	{ "input": [ "56 25 31", "10 30 20", "30 30 100" ], "output": [ "Yes", "Yes", "No" ] }	{"input":["89 1\n50 53 97 41 68 27 53 66 93 19 11 78 46 49 38 69 96 9 43 16 1 63 95 64 96 6 34 34 45(...TRUNCATED)	{"input":["2 2\n2 3\n2 3\n2 3\n2 2\n5 2","2 2\n2 3\n2 2\n2 3\n2 2\n2 2","2 2\n2 3\n2 3\n2 2\n2 2\n5 (...TRUNCATED)	5	13	{"language":[2],"solution":["#include <algorithm>\n#include <cassert>\n#include <climits>\n#include (...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,0,2,2,2,0,0,2,4,2,2,3,2(...TRUNCATED)	1,490		1,500	2,500	[]	false		{ "nanos": 0, "seconds": 1 }	536,870,912
1165_A. Remainder	"You are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N. You can perform the following o(...TRUNCATED)	{ "input": [ "4\n1 14\n1 50\n4 28\n5 700\n\nSAMPLE" ], "output": [ "1\n10\n3\n32491" ] }	{ "input": [], "output": [] }	{"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	9	{"language":[2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,4,4(...TRUNCATED)	{"language":[2,2,2,2,2,3,2,2,4,4,4,2,4,4,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0		0	2,000	[]	false		{ "nanos": 0, "seconds": 1 }	64,000,000
roys-life-cycle	"Andrew plays a game called \"Civilization\". Dima helps him.\n\nThe game has n cities and m bidirec(...TRUNCATED)	{ "input": [ "0 0\n1 1\n1 1\n", "0 0\n1 1\n0 1\n", "0 0\n1 1\n2 2\n" ], "output": [ "YES\n", "YES\n", "NO\n" ] }	{ "input": [], "output": [] }	{"input":["42 28\n7 19\n15 24\n3 42\n18 5\n32 27\n26 20\n40 30\n35 2\n14 8\n22 8\n36 4\n16 14\n21 29(...TRUNCATED)	3	11	{"language":[2,3,2,2,2,2,4,3,3,3,3,2,2,2,2,2,3,2,2,2,3,2,2,2,2,3,1,3,3,3,2,4,3,2,4,3,4,2,2,3,2,2,2,2(...TRUNCATED)	{"language":[3,2,2,2,2,2,3,2,2,2,2,2,2,3,2,2,2,3,2,2,3,2,2,2,3,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	0	F	0	2,300	[ "greedy", "implementation" ]	false	"E - Disappear Drive / 消えるドライヴ\n\nStory\n\nDのひとはバスケットボールが好(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	134,217,728
1208_A. XORinacci	"You are given a string s consisting of n lowercase Latin letters.\n\nLet's define a substring as a (...TRUNCATED)	{"input":["ababababa\n3\n2 1 7 aba\n1 5 c\n2 1 7 aba\n","abcdcbc\n5\n2 1 7 bc\n1 4 b\n2 4 7 bc\n1 2 (...TRUNCATED)	{"input":["85 30 123\n","100000 100000 1320777\n","94728 36278 300352\n","70386 4182 113682\n","6518(...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)	2	9	{"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":[2,2,3,4,4,4,1,2,3,4,3,1,2,4,4,2,4,4,1,4,3,3,3,2,4,3,2,4,2,2,2,2,2,2,4,2,4,4,4,2,4,3,2,4(...TRUNCATED)	0	E	0	1,600	[ "brute force" ]	false	"あなたは友人と旅行に行きたいと考えています。ところが、浪費癖のある(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
133_D. Piet	"In some country live wizards. They love playing with numbers. \n\nThe blackboard has two numbers wr(...TRUNCATED)	{"input":["4 4\n1 2 1 10\n2 4 3 5\n1 3 1 5\n2 4 2 7\n","5 6\n1 2 1 10\n2 5 11 20\n1 4 2 5\n1 3 10 11(...TRUNCATED)	{"input":["20\n9 4 8\n10 6 7\n4 6 0\n7 7 6\n3 3 10\n4 2 1\n4 4 0\n2 0 0\n8 8 7\n3 1 7\n3 10 7\n1 7 3(...TRUNCATED)	{"input":["10803140200\n","14\n","11\n","174813966899\n","13753962\n","601828654335\n","114141413978(...TRUNCATED)	3	8	{"language":[4,4,4,2,4,1,2,2,2,2,3,2,2,4,3,2,1,3,2,3,2,2,1,2,2,4,2,4,2,4,2,2,1,4,1,2,2,4,2,1,3,4,2,2(...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)	0		0	0	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
820_A. Mister B and Book Reading	"problem\n\nIf you write a positive integer in decimal notation (without leading 0) and look at the (...TRUNCATED)	{ "input": [ "ACM" ], "output": [ "0" ] }	{"input":["20\n76 86 70 7 16 24 10 62 26 29 40 65 55 49 34 55 92 47 43 100\n","100\n6591 1074 3466 3(...TRUNCATED)	{"input":["605 297 -440074875 -366763764 -445828791 325081312\n","14 9 44 1 -50 -9\n","16 17 -260784(...TRUNCATED)	3	9	{"language":[3,2,3,2,2,3,3,3,3,4,4,2,3,3,4,2,3,4,2,3,2,2,3,2,2,3,4,2,2,3,3,3,3,3,2,2,2,3,4,3,3,2,1,2(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,1,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	235	B	0	0	[ "dfs and similar", "graphs" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
85_D. Sum of Medians	"Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclu(...TRUNCATED)	{ "input": [ "4\n6 6 5 5\n", "5\n1 2 3 1 3\n", "4\n6 6 4 4\n" ], "output": [ "0", "4", "-8" ] }	{"input":["10\n5 1 33242121\n5 7 535463871\n9 1 202863787\n5 4 874413088\n6 1 623012241\n6 8 7866591(...TRUNCATED)	{"input":["5 10\n2 1 2 2 2\n2\n2 4\n4 5\n","5 10\n2 1 2 2 1\n2\n2 4\n4 5\n","5 10\n3 1 4 2 1\n2\n2 4(...TRUNCATED)	2	15	{"language":[2,2,2,2,2,3,3,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,0,2,2,0,2,2,0],"solution":["#include <bits/stdc++.h>\n#define pq priority_queue\nusin(...TRUNCATED)	209		0	2,200	[ "" ]	false		null	256,000,000
p03455 AtCoder Beginner Contest 086 - Product	"Snuke has decided to play a game, where the player runs a railway company. There are M+1 stations o(...TRUNCATED)	{ "input": [ "5 1", "4 972439611840", "3 24", "1 111" ], "output": [ "1", "206", "2", "111" ] }	{"input":["7 9 999999999 0 3\n0 1 0\n1 2 0\n2 3 0\n0 4 1\n4 1 1\n1 5 499999999\n5 2 499999999\n2 6 1(...TRUNCATED)	{ "input": [], "output": [] }	3	7	{"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":[2,2,2,2,4,2,4,2,4,2,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2(...TRUNCATED)	1,158	F	250	1,100	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
1144_B. Parity Alternated Deletions	"The russian intelligence agency KGB make an encryption technique to send their passwords. Originall(...TRUNCATED)	{"input":["4 1111\n1 10 100 1000","3 70\n20 30 10","3 10\n20 30 10","2 10\n20 20"],"output":["4","2"(...TRUNCATED)	{ "input": [], "output": [] }	{"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	2	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	A1	500	1,600	[]	false		{ "nanos": 0, "seconds": 6 }	0