Datasets:

TheFactoryX
/

edition_1338_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
p01691 Disappear Drive	"Long time ago, there was a great kingdom and it was being ruled by The Great Arya and Pari The Grea(...TRUNCATED)	{ "input": [ "4\n62 96 82 55\n\nSAMPLE" ], "output": [ "3 1 2 4\n" ] }	{"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":["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)	6	0	{"language":[2,2,2,2,2,2,4,4,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,4,2(...TRUNCATED)	{"language":[2,2],"solution":["#include <bits/stdc++.h>\n \n#define _overload(_1,_2,_3,name,...) nam(...TRUNCATED)	0	G	1,000	0	[ "binary search", "dp" ]	false		null	0
536_C. Tavas and Pashmaks	"Tavas is a cheerleader in the new sports competition named \"Pashmaks\".\n\n<image>\n\nThis competi(...TRUNCATED)	{"input":["5 18 1000\n","132 10 35\n","48 132 235\n","2 2 1\n"],"output":["-1","5 7\n","22 111","1 1(...TRUNCATED)	{"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":["100 1 7\n83\n174\n191\n145\n167\n55\n232\n157\n51\n209\n85\n73\n216\n39\n72\n76\n132\n70\(...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,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,3,2,4,3,2,2,2,2,2,2,3,4,2,2,2,0,2,0,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,2,4,2,1,1,3(...TRUNCATED)	331	A	0	3,000	[]	false		{ "nanos": 0, "seconds": 10 }	0
p03294 AtCoder Beginner Contest 103 - Modulo Summation	"There are three arrays a, b and c. Each of them consists of n integers. SmallY wants to find three (...TRUNCATED)	{"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":["605 297 -251700323 -366763764 -445828791 325081312\n","14 9 44 45 -50 -9\n","18 17 -26078(...TRUNCATED)	{"input":["5 3\n00011\n3\n1 2 3\n1\n4\n3\n2 4 5\n","1 1\n0\n1\n1\n","1 0\n1\n1\n1\n","8 6\n00100011\(...TRUNCATED)	2	11	{"language":[4,3,2,4,3,4,2,4,4,2,3,3,2,3,3,3,3,3,4,2,3,2,3,2,4,4,2,4,3,2,4,3,2,4,4,3,2,2,4,3,3,4,2,4(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,2,1,4,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,4,2,2,2(...TRUNCATED)	1,297	B	0	900	[ "dfs and similar", "greedy", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p02548 AtCoder Beginner Contest 179 - A x B + C	"Two little greedy bears have found two pieces of cheese in the forest of weight a and b grams, corr(...TRUNCATED)	{ "input": [ "2 3\n", "1 1\n", "49 1808\n" ], "output": [ "6\n", "0\n", "359087121\n" ] }	{ "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	7	{"language":[4,2,1,3,3,3,2,3,3,3,3,3,2,4,4,3,3,4,4,2,4,3,1,4,2,3,3,3,3,4,4,2,3,4,2,3,2,1,3,2,3,4,4,2(...TRUNCATED)	{"language":[2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,1,2,2,4,2,2,2,2,2,2,2,4,2,4(...TRUNCATED)	0	A	2,500	0	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
331_E2. Deja Vu	"Golu is given a task of clearing coins fallen down on floor. Naughty being his modus operandi, he (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\nAZAMON APPLE\nAZAMON AAAAAAAAAAALIBABA\nAPPLE BANANA\n"],"output":["AAZMON\n---\nAEPLP(...TRUNCATED)	{"input":["1 1\n-1\n","5 1\n-3 -2 -1 0 0\n","7 1\n-7 ? ? ? ? ? 2\n","3 2\n-5 ? 0\n","7 4\n-10 0 ? 1 (...TRUNCATED)	2	1	{"language":[1,1,1,1,1,1,1,1,1,1,1,1],"solution":["import math\nimport sys\ndef checkpal(s):\n re(...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)	1,398	F	0	0	[ "math" ]	true		{ "nanos": 0, "seconds": 1 }	1,073,741,824
323_C. Two permutations	"Linda likes to change her hair color from time to time, and would be pleased if her boyfriend Archi(...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":["2 2 1\n0 1 1 1\n","5 5 20\n3 1 3 3\n1 2 2 2\n4 3 4 2\n3 2 2 2\n3 4 2 4\n4 1 4 5\n4 3 5 3\(...TRUNCATED)	{"input":["36 102 73 101 19\n5 9 2 4 6\n4 13\n","0 0 119 0 1\n0 0 2 0 0\n5 5\n","0 0 0 0 0\n10 10 10(...TRUNCATED)	2	17	{"language":[4,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,1,2,2,2,2,2,2,4,2,4,2,2,2,4,2,2,2,2,2,2,2,2,4,4,2,1,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	1,600	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
1117_F. Crisp String	"Problem Description\n\nGiven a list of integers, find and display all even numbers from the end of (...TRUNCATED)	{ "input": [ "5 5 10 5 4\n", "12 4 12 4 1\n", "15 1 100 0 0\n" ], "output": [ "1\n", "3\n", "15\n" ] }	{ "input": [], "output": [] }	{"input":["993 992 471\n","960 935 1422\n","105 8 99\n","60 1 1\n","759 10 123\n","31 19 9\n","1705 (...TRUNCATED)	1	0	{"language":[2,2,4,4,4,4,4,3,2,2,3,2,2,3,2,4,2,2,2,4,2,2,4,4,2,2,4,2,4,3,2,2,2,2,2,3,2,2,2,2,2,2,4,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)	507	B	1,000	2,000	[ "divide and conquer", "hashing", "sortings", "strings" ]	false		null	0
178_A1. Educational Game	"You are given a simple connected undirected graph G consisting of N vertices and M edges. The verti(...TRUNCATED)	{ "input": [ "5\n1 2 4 7 10" ], "output": [ "2 10" ] }	{ "input": [], "output": [] }	{"input":["3\n3 2 0\n","3\n1 2 0\n","3\n2 0 2\n","11\n1 1 1 1 1 2 4 2 2 2 1\n","5\n1 1 2 1 2\n","5\n(...TRUNCATED)	2	10	{"language":[2,2,1,2,2,4,3,2,4,4,2,4,2,3,2,4,2,2,4,2,4,3,2,2,2,2,4,4,4,2,2,2,2,2,2,4,2,2,2,2,4,4,2,4(...TRUNCATED)	{"language":[3,3,2,4,4,4,4,3,3,3,3,3,2,2,4,1,3,4,2,3,2,3,3,3,4,4,4,2,3,4,3,4,4,3,3,3,2,4,3,3,4,2,3,4(...TRUNCATED)	0		0	1,800	[ "constructive algorithms" ]	false	"Background\n\n会津大学付属幼稚園はプログラミングが大好きな子供が集まる(...TRUNCATED)	{ "nanos": 0, "seconds": 6 }	256,000,000
361_C. Levko and Array Recovery	"Two players play the following game. Initially, the players have a knife and a rectangular sheet of(...TRUNCATED)	{ "input": [ "4\nRRBR", "4\nBRBR" ], "output": [ "Yes", "No" ] }	{"input":["10 20 10 5\n","20 1 2 3\n","7 2 2 2\n","25 10 5 10\n","999 999 899 299\n","10000 5000 0 5(...TRUNCATED)	{"input":["3 2\n3\n2\n1","3 4\n3\n2\n1","3 0\n3\n2\n1","3 001\n3\n2\n1","5 1\n5\n3\n2\n1\n4","5 6\n1(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,046		0	1,100	[ "data structures", "dfs and similar", "graphs", "greedy" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
470_C. Eval	"Lee tried so hard to make a good div.2 D problem to balance his recent contest, but it still doesn'(...TRUNCATED)	{ "input": [ "11 5 2\n11010100101\n", "11 5 1\n11010100101\n" ], "output": [ "1\n", "3\n" ] }	{"input":["7 2\n-10 0 ? 1 ? 2 10\n","1 1\n0\n","5 1\n-3 -2 -1 0 1\n","7 1\n-4 ? ? ? ? ? 2\n","17 1\n(...TRUNCATED)	{"input":["15 12\n2 3\n2 14\n4 3\n4 10\n3 5\n1 4\n1 12\n4 15\n1 9\n10 7\n11 2\n12 8\n15 13\n1 6\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,4,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,4,2,2,2,0,2,2,0,0,0,0,2,0,2,2,2,2,2,2,4,0,1,4,4,4(...TRUNCATED)	1,281		0	2,700	[]	false	"標準録画で 120 分のビデオテープがあります。テープを完全に巻き戻した(...TRUNCATED)	{ "nanos": 0, "seconds": 8 }	134,217,728