Datasets:

TheFactoryX
/

edition_2975_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	time_limit dict	memory_limit_bytes int64 0 1.07B
substrings-count-3	"One day Polycarpus stopped by a supermarket on his way home. It turns out that the supermarket is h(...TRUNCATED)	{ "input": [ "4 1\n1 2 3 4\n1 3\n\nSAMPLE" ], "output": [ "6 0\n" ] }	{"input":["20 18 1 2\n-9999944 -9999861 -9999850 -9999763 -9999656 -9999517 -9999375 -9999275 -99992(...TRUNCATED)	{"input":["3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 10","2 2\n2 0\n0 0\n-1 -1\n1 0","3 4\n10 10\n-(...TRUNCATED)	3	11	{"language":[4,2,2,4,2,2,2,2,4,2,3,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,1,4,2,2,2,4,2,2,4,2,2,2,2,2,2,4,2,2(...TRUNCATED)	{"language":[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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	385	E	2,750	0	[ "" ]	false	null	256,000,000
161_B. Discounts	"There are n psychos standing in a line. Each psycho is assigned a unique integer from 1 to n. At ea(...TRUNCATED)	{"input":["3\n4\nS010\n0001\n1000\n111F\n3\nS10\n101\n01F\n5\nS0101\n00000\n01111\n11111\n0001F\n"],(...TRUNCATED)	{ "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	7	{"language":[2,2,2,2,2,4,2,2,2,2,1,4,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,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)	1,269		1,000	1,800	[]	false	null	0
105_C. Item World	"Polycarp plays a computer game. In this game, the players summon armies of magical minions, which t(...TRUNCATED)	{ "input": [ "??00????0??0????0?0??00??1???11?1?1???1?11?111???1", "0??0", "0??" ], "output": [ "4", "2", "1" ] }	{ "input": [], "output": [] }	{"input":["2 0\n","3 1\n1 2 0\n","3 3\n1 2 2 3 2\n1 1 2 3 3\n2 3 2 2 3\n","11 17\n1 2 5 3 4 1 2 10\n(...TRUNCATED)	2	8	{"language":[2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace std;\n#defi(...TRUNCATED)	{"language":[4,4,4,1,2,4,1,4,2,4,1,4,2,1,1,2,1,4,2,3,4,3,3,4,2,4,2,2,4,4,3,1,2,2,2,3,4,3,4,2,3,3,2,2(...TRUNCATED)	0		0	0	[ "ternary search" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
p01931 Check answers	"Snuke has decided to play a game, where the player runs a railway company. There are M+1 stations o(...TRUNCATED)	{"input":["? - ? = 1\n","? + ? - ? + ? + ? = 42\n","? = 1000000\n"],"output":["Impossible\n","Possib(...TRUNCATED)	{"input":["2016 4549\n433\n","5000 1\n3\n","4035 369\n26\n","1595 2881\n710\n","3762 3914\n1073\n","(...TRUNCATED)	{"input":["11\n54 91 4 6 88 23 38 71 77 10 84\n","20\n12 37 81 56 61 2 26 27 59 69 24 7 71 76 45 54 (...TRUNCATED)	2	7	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\n\nusing names(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,1,2,2,4,2,2,2,2,2,2,4(...TRUNCATED)	101		0	900	[ "binary search", "data structures", "dfs and similar", "dsu", "shortest paths", "two pointers" ]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
p02445 Swap	"There were n types of swords in the theater basement which had been used during the plays. Moreover(...TRUNCATED)	{ "input": [ "4\n4 4 4\n", "5\n2 3 5 5\n" ], "output": [ "6\n", "17\n" ] }	{ "input": [], "output": [] }	{"input":["9 1004498469 6\n","1 0 10\n","1944219055 33463955 1369298327\n","914835 4386500 9234739\n(...TRUNCATED)	3	7	{"language":[3,2,2,4,2,2,2,4,3,3,4,4,4,4,2,2,4,2,1,2,2,3,3,4,1,4,4,4,3,3,3,4,3,3,2,2,2,2,2,2,3,4,2,2(...TRUNCATED)	{"language":[2,3,3,2,2,3,2,4,3,3,2,2,4,4,4,2,4,4,4,4,3,2,4,3,2,2,2,2,2,3,2,2,2,2,2,3,4,4,4,2,4,2,4,3(...TRUNCATED)	0		0	2,200	[ "implementation" ]	false	{ "nanos": 0, "seconds": 5 }	1,073,741,824
prpaln	"We have a string s consisting of lowercase English letters. Snuke is partitioning s into some numbe(...TRUNCATED)	{"input":["5 5\n3 2 3 1 1\n","4 3\n2 1 4 3\n","2 0\n2 2\n"],"output":["1\n5\n1 4 2 3 5 \n","-1\n","0(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3 1 2\n1\n1 1\n","3 0 3\n\n334 500 0001\n","3 0 3\n\n333 187 1001\n","6 2 3\n2 3\n1 1 1\n(...TRUNCATED)	3	8	{"language":[1],"solution":["t = int(raw_input())\nfor _ in range(t):\n\tn, a, b, c = map(int, raw_i(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,3,2,2,3,2,2,4,2,4,2,2,2,2,3,2,4,4,4,2,2,2,2,2,3,2,2,2,4,4,4,4,4,3,2,2,1,3(...TRUNCATED)	977		500	2,300	[ "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
776_A. A Serial Killer	"Write a program of the Selection Sort algorithm which sorts a sequence A in ascending order. The al(...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": [], "output": [] }	{"input":["10 9\n2 5\n2 4\n2 7\n2 9\n2 3\n2 8\n2 6\n4 10\n2 1\n","10 10\n6 4\n9 2\n3 6\n6 7\n4 2\n9 (...TRUNCATED)	5	9	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2],"solution":["#include<cmath>\n#include<queue>\(...TRUNCATED)	{"language":[2,2,2,4,2,2,2,2,4,2,2,2,4,2,2,4,4,4,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,4,2,2,1,2,2,3,4,2(...TRUNCATED)	0	B	0	0	[ "graphs" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
ig01	"Given an integer n and a permutation of numbers 1, 2 ... , n-1, n write a program to print the perm(...TRUNCATED)	{ "input": [ "1 1 1 4 4\n", "2 0 0 0 4\n", "4 5 6 5 6\n" ], "output": [ "3\n", "1\n", "0\n" ] }	{ "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	12	{"language":[2,1,4,3,2,2,1,3,2,1,2,2,4,4,2,2,1,4,4,2,3,3,3,2,2,2,2,2,3,1,2,4,4,4,4,2,2,3,3,4,2,2,1,4(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,4,4,2,2,3,2,2,2,2,2,2,2,4,2,2,4,4,4,4,2,2,3,2,2,4,4,4,2,2,4,4,2,4,2,2,4,2(...TRUNCATED)	1,285	B	2,500	2,500	[ "dp", "greedy" ]	false	{ "nanos": 0, "seconds": 4 }	256,000,000
acdemy	"New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n (...TRUNCATED)	{"input":["2\n1000000 1000000\n","6\n5 1 2 4 6 3\n","5\n1 5 7 8 2\n"],"output":["1000000\n","0\n","0(...TRUNCATED)	{"input":["wwwww w\n8\nwwwww wwwwwwww\nwwwwwwww wwwwwwwww\nwwwwwwwww wwwwwwwwww\nw www\nwwwwwwwwww w(...TRUNCATED)	{"input":["6\n0 1 3 2 2 2\n","4\n0 2 1 1\n","4\n3 1 1 0\n","4\n1 2 1 0\n","6\n0 0 0 2 1 1\n","4\n1 1(...TRUNCATED)	2	0	{"language":[2,4,3,4,4,2,2,2,4,2,2,2,4,4,4,3,2,2,2,2,4,3,4,4,2,2,4,4,4,3,3,1,2,2,3,3,2,4,2,4,4,3,2,1(...TRUNCATED)	{"language":[2,2,4,4,3,3,4,2,3,3,2,3,2,3,4,3,4,2,4,4,3,2,3,3,2,1,4,3,2,3,4,4,3,3,3,3,3,3,2,4,4,2,2,4(...TRUNCATED)	0	E	0	800	[ "implementation", "math" ]	false	{ "nanos": 500000000, "seconds": 2 }	256,000,000
p00819 Unreliable Message	"You are given an array A of size N, and Q queries to deal with. For each query, you are given an in(...TRUNCATED)	{"input":["1 1 1\n","3 1 0\n"],"output":[" (...TRUNCATED)	{"input":["2\n1 1 3 1\n3\n0 1 2\n"],"output":[" (...TRUNCATED)	{"input":["3 3\n2 4 1 0 1\nXAX\nB.B\nXAX","3 6\n2 4 1 1 1\nXXA\nB.B\nXAX","10 6\n1 9 1 2 3\nYXA\nB.B(...TRUNCATED)	6	11	{"language":[2,2,4,2,2,3,4,2,2,2,1,2,4,2,2,4,4,2,2,2,4,4,2,2,4,2,2,2,4,2,4,2,2,2,2,2,1,4,2,2,4,2,2,2(...TRUNCATED)	{"language":[3,3,2,2,3,2,1,1,2,3,2,4,2,2,4,1,4,4,3,2,3,3,4,4,4,4,1,3,2,2,4,2,4,4,4,2,2,2,4,4,1,2,3,2(...TRUNCATED)	1,202	E	0	1,700	[ "greedy", "implementation", "math", "ternary search" ]	false	{ "nanos": 0, "seconds": 1 }	0