Datasets:

TheFactoryX
/

edition_2967_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	untranslated_description large_stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
633_H. Fibonacci-ish II	"There are some coins in the xy-plane. The positions of the coins are represented by a grid of chara(...TRUNCATED)	{"input":["5 3 2\nSba\nccc\naac\nccc\nabT\n","3 4 1\nSxyy\nyxxx\nyyyT\n","1 3 3\nTyS\n","1 4 1\nSxyT(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10\n669924290 408119795 283272835\n663737793 250734602 29671646\n431160679 146708815 2894(...TRUNCATED)	6	0	{"language":[4,2,4,4,4,2,2,4,4,2,4,3,4,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,4,2,4,1,4,2,2,4,2,1,2,2,2,2,2(...TRUNCATED)	{"language":[4,4,4,4,3,2,2,2,1,2,2,2,2,4,4,2,2,4,2,4,4,2,2,3,2,1,3,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0		0	1,900	[ "bitmasks", "dp", "graphs", "number theory" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
7_B. Memory Manager	"In the intergalactic empire Bubbledom there are N planets, of which some pairs are directly connect(...TRUNCATED)	{"input":["5\nAJMP\naB23d\nE\n86AE\nAM\n6\nJPEM\nWaEaETC302Q\nCP\nrTurnAGundam1isdefferentf"],"outpu(...TRUNCATED)	{"input":["2 5 1\n0 5 6\n0 2 7\n","1 1 1000000000\n0 0 0\n","2 200 5\n1 1 1\n12 3 15\n","2 10 5\n1 1(...TRUNCATED)	{"input":["3\n2 3\n3 6\n1 2\n3\n2 3\n3 5\n2 2\n0","3\n2 3\n3 6\n2 2\n3\n3 3\n3 6\n2 2\n0","3\n2 1\n3(...TRUNCATED)	2	0	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,4,4,4,2,2,2,4,4,2,1,3,2,2,2,4,2,2,2,4,4,2,2,2,2(...TRUNCATED)	0	D	0	1,900	[ "brute force", "greedy" ]	false		{ "nanos": 0, "seconds": 2 }	0
151_C. Win or Freeze	"Vasya has a sequence a consisting of n integers a_1, a_2, ..., a_n. Vasya may pefrom the following (...TRUNCATED)	{"input":["4\n..E.\n.AD.\nB...\n..C.\nD\n4\n..E.\n.AD.\nB...\n..C.\nDR\n3\n...\n.A.\nBC.\n((URD)3L)2(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\nnxx","3\nnwx","3\nxxo","3\nxwn","3\nowx","3\npxx","3\npyx","3\npzx","3\npzw","3\npwz",(...TRUNCATED)	6	0	{"language":[2],"solution":["#include <algorithm>\n#include <cassert>\n#include <climits>\n#include (...TRUNCATED)	{ "language": [], "solution": [] }	1,311		2,500	1,600	[ "brute force", "constructive algorithms", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1202_C. You Are Given a WASD-string...	"You are given a matrix consisting of n rows and m columns. The matrix contains lowercase letters of(...TRUNCATED)	{ "input": [ "5 5\n1 2 3 4 5\n", "3 1\n1 1 2\n", "5 2\n1 1 2 1 3\n" ], "output": [ "16", "3", "14" ] }	{ "input": [], "output": [] }	{"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)	3	16	{"language":[2,1,3,4,1,4,1,4,2,3,4,2,4,1,2,3,2,2,4,3,2,4,2,2,2,4,4,3,2,4,4,4,4,1,1,3,2,2,2,4,1,4,1,2(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,2,2,2,0,2,2,0,0,2,2,2,4,2,2,0,2,4,3,2,2,2,4,2,2,3,2,2,0,0,2,2,2,2,2,0,2,2(...TRUNCATED)	0		0	0	[ "data structures", "greedy" ]	false		{ "nanos": 0, "seconds": 2 }	0
1012_E. Cycle sort	"There is little time left before the release of the first national operating system BerlOS. Some of(...TRUNCATED)	{ "input": [ "2\n5\n2 3 5 1 2\n3\n1 2 3" ], "output": [ "3\n3" ] }	{ "input": [], "output": [] }	{"input":["100 5\n1\n23\n45\n47\n89","10 2\n4\n1","4 1\n3","100 3\n1\n23\n45\n47\n89","100 0\n1\n23\(...TRUNCATED)	2	11	{"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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,136	C	0	1,800	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p00720 Earth Observation with a Mobile Robot Team	"Bhavana and Bhuvana place bet every time they see something interesting that can occur with a proba(...TRUNCATED)	{ "input": [ "15 20\n", "14 8\n", "6 6\n" ], "output": [ "3\n", "-1\n", "0\n" ] }	{"input":["10\n5 1 33242121\n5 7 535463871\n9 1 202863787\n5 4 874413088\n6 1 623012241\n6 8 7866591(...TRUNCATED)	{"input":["2\n2\n2 1\n1\n6","2\n2\n2 2\n1\n8","2\n2\n4 2\n1\n6","2\n1\n2 1\n1\n1","2\n3\n3 2\n1\n8",(...TRUNCATED)	3	11	{"language":[1,1,1],"solution":["for _ in range(input()):\n try:\n eval(raw_input())\n (...TRUNCATED)	{"language":[2,1,4,2,2,2,4,2,3,2,2,2,2,4,2,2,2,2,2,2,3,4,2,4,4,4,2,3,4,3,2,3,4,3,2,2,3,2,2,4,2,2,4,2(...TRUNCATED)	0	B	1,000	2,000	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
530_C. Diophantine equation	"In a mystical TimeLand, a person's health and wealth is measured in terms of time(seconds) left. \n(...TRUNCATED)	{ "input": [ "4 4\n1 2\n2 3\n3 4\n4 1\n", "3 0\n" ], "output": [ "\n0 1 0 1 \n", "\n0 0 0 \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)	2	0	{"language":[1,2,4,3,2,2,2,3,4,2,3,1,2,2,4,2,4,4,2,2,1,4,4,2,4,2,2,2,2,2,3,1,2,2,4,4,4,1,2,2,3,4,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	343	A	1,000	1,800	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
188_D. Asterisks	"You are given a permutation p_1, p_2, …, p_n.\n\nIn one move you can swap two adjacent values.\n\(...TRUNCATED)	{"input":["5\n8 5\n6 4\n4 3\n7 10\n0 10\n10\n10 5\n2 7\n9 7\n8 10\n10 2\n1 2\n8 1\n6 7\n6 0\n0 9\n5\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 1 2 2 1\n2 1\n","5 2 2 1 8\n1 1 2\n1 5 3\n1 2 1\n2 2\n1 4 2\n1 3 0\n2 1\n2 3\n","5 2 2 (...TRUNCATED)	2	9	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	609		1,750	1,800	[ "*special" ]	false		{ "nanos": 0, "seconds": 2 }	0
laddu	"You are given two permutations p and q, consisting of n elements, and m queries of the form: l1, r1(...TRUNCATED)	{ "input": [ "3\n25\n46\n99" ], "output": [ "2\n1\n2\n" ] }	{"input":["1\n2\n999999997 999999998\n999999999 1000000000\n","4\n1\n1 1000000000\n5\n1 1\n12 18\n10(...TRUNCATED)	{"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	12	{"language":[3,2,4,3,2,4,2,3,4,3,3,4,2,2,3,3,2,2,3,2,3,2,3,4,2,2,2,2,2,2,3,3,2,2,2,2,2,3,2,3,2,2,2,2(...TRUNCATED)	{"language":[3,1,4,4,2,1,4,4,3,4,3,4,4,2,4,1,3,2,2,3,2,4,1,2,2,1,2,1,3,2,2,2,4,4,2,2,3,3,4,2,2,2,3,1(...TRUNCATED)	0	A	1,000	0	[ "graphs", "greedy", "sortings" ]	false	"差分パルス符号変調は主に音声信号を圧縮する際に用いられる圧縮手法の(...TRUNCATED)	{ "nanos": 0, "seconds": 5 }	256,000,000
play-with-string	"Given an integer n and a permutation of numbers 1, 2 ... , n-1, n write a program to print the perm(...TRUNCATED)	{ "input": [ "1\n", "4\n", "6\n", "2\n" ], "output": [ "1 1\n", "1 4\n", "2 3\n", "1 2\n" ] }	{"input":["5 2 5\n3 5 2 1\n2 3 1 4\n1 4 3 1\n2 3 1 2\n2 3 1 5\n","2 1 1\n1 2 1 1\n","1 2 1\n1 1 3 1\(...TRUNCATED)	{"input":["3 1\n2 100 1","12 5\n43 94 27 3 69 99 56 25 15 15 46 8","3 1000\n1 101 1","6 24\n25 171 7(...TRUNCATED)	2	9	{"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],"sol(...TRUNCATED)	{"language":[2,2,2,1,1,2,2,2,2,4,2,2,2,4,2,4,4,2,3,2,2,2,2,1,4,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,1,2,4(...TRUNCATED)	1,037	E	0	2,100	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000