Datasets:

TheFactoryX
/

edition_1582_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
stadium	"You have a string s — a sequence of commands for your toy robot. The robot is placed in some cell(...TRUNCATED)	{ "input": [ "2\nSHILPA\nAAMIR\nMATT\nDENISE" ], "output": [ "ENEMIES\nLOVE" ] }	{"input":["99 100 100 100 100\n","57 83 11 4 93\n","99 99 99 99 99\n","100 0 0 0 0\n","0 1 2 3 4\n",(...TRUNCATED)	{"input":["21 6\n12 15 14 4 4 7 3 4 11 1 15 4 12 11 12 8 11 12 3 4 4\n","50 25\n19 1 17 6 4 21 9 16 (...TRUNCATED)	2	7	{"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":[2,4,2,2,2,2,3,2,2,2,1,2,2,2,4,2,2,2,4,4,1,2,4,4,2,1,4,4,4,2,2,2,2,4,2,2,2,1,2,4,2,2,2,2(...TRUNCATED)	242	C	500	0	[ "" ]	false		null	256,000,000
1391_C. Cyclic Permutations	"Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at(...TRUNCATED)	{ "input": [ "2\n1\n2\n", "3\n1\n1\n2\n" ], "output": [ "NO\n", "YES\n" ] }	{"input":["3 1 2\n2\n1 1\n","3 1 2\n1\n8 61\n","3 0 3\n\n334 500 1001\n","20 16 16\n1 2 3 4 5 6 8 9 (...TRUNCATED)	{"input":["1000 1001\n82 636 713 516\n","1000 1998\n316 681 19 233\n","4 8\n1 3 4 2\n","5 6\n4 3 2 1(...TRUNCATED)	2	2	{"language":[2,3,2,2,4,3,3,3,3,4,4,4,3,4,2,3,3,2,3,3,2,4,3,3,3,2,2,1,3,3,3,3,4,3,1,4,3,3,3,2,3,2,3,3(...TRUNCATED)	{"language":[3,1,3,2,1,2,2,2,4,2,3,4,2,4,2,4,2,3,1,3,4,3,2,2,4,3,2,2,1,2,4,2,4,3,4,2,4,2,4,4,4,3,2,4(...TRUNCATED)	0	A	0	1,900	[]	false		null	256,000,000
633_H. Fibonacci-ish II	"Snuke has decided to play a game, where the player runs a railway company. There are M+1 stations o(...TRUNCATED)	{"input":["3 100\n3\n2\n1","3 1\n3\n2\n1","5 3\n5\n3\n2\n1\n4","5 3\n1\n2\n3\n4\n5"],"output":["3\n2(...TRUNCATED)	{"input":["46\n63 1\n63 63\n123 1\n123 123\n63 2\n63 62\n123 2\n123 122\n63 3\n63 61\n123 3\n123 121(...TRUNCATED)	{"input":["6\n3\n60\n100\n1024\n23456\n8735373\n\nELPMAS","6\n5\n60\n100\n1024\n23456\n8735373\n\nEL(...TRUNCATED)	2	0	{"language":[2,4,3,2,3,2,2,3,2,3,4,3,2,3,3,2,2,2,2,2,2,4,2,4,3,4,3,2,2,2,2,2,2,3,3,3,3,3,2,3,2,3,4,3(...TRUNCATED)	{ "language": [], "solution": [] }	1,439		500	0	[]	false		{ "nanos": 0, "seconds": 3 }	0
40_B. Repaintings	"Tavas is a cheerleader in the new sports competition named \"Pashmaks\".\n\n<image>\n\nThis competi(...TRUNCATED)	{"input":["3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 5","2 2\n2 0\n0 0\n-1 0\n1 0","5 5\n-100000000(...TRUNCATED)	{ "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	0	{"language":[3,3,2,4,4,3,2,3,4,4,1,4,3,1,3,1,2,4,3,1,3,4,2,1,2,2,2,3,3,3,3,4,3,2,4,4,2,4,2,3,2,2,1,1(...TRUNCATED)	{"language":[2,2,4,2,3,2,2,1,2,4,2,2,2,3,2,4,2,2,2,4,4,1,4,4,1,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,4,1(...TRUNCATED)	0	B	0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1195_D2. Submarine in the Rybinsk Sea (hard edition)	"Hexadecimal likes drawing. She has drawn many graphs already, both directed and not. Recently she h(...TRUNCATED)	{ "input": [ "1000 352 146\n", "10 1 14\n", "20 10 50\n" ], "output": [ "1108\n", "1\n", "0\n" ] }	{"input":["21 3 -3 3 -3 3 -3 19 3 -3 3 -3 3 -3 19 3 -3 3 -3 3 -3 19","2 8 -100\n5 -1000 5 1000 500 2(...TRUNCATED)	{"input":["2 5 1\n0 4 6\n0 2 7\n","1 1 1000000000\n0 0 1\n","5 200 10\n1 1 1\n1000000000 200 1000000(...TRUNCATED)	2	0	{"language":[3,4,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,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	E	3,750	1,800	[ "" ]	true		{ "nanos": 0, "seconds": 3 }	256,000,000
p01086 Short Phrase	"There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on(...TRUNCATED)	{ "input": [ "2\n" ], "output": [ "25\n" ] }	{"input":["7\n","2000000000000000000\n","1000000000000000000\n","987654321012345678\n"],"output":["2(...TRUNCATED)	{"input":["3\n1\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1","3\n2\n0 1\n0 -1\n1 0\n2\n0 1\n(...TRUNCATED)	2	8	{"language":[2,2,2,3,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,3,2,4,2,2,2,2,2,2,2,4,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	D	500	0	[ "number theory" ]	false	"うさぎがある電車のチケットをn 枚持っている. チケットにはそれぞれ0 か(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	0
1107_D. Compression	"There are n lamps on a line, numbered from 1 to n. Each one has an initial state off (0) or on (1).(...TRUNCATED)	{"input":["2 7\n4\n2\n1\n0\n-1\n-2\n-4\n131\n137\n2 7\n4\n2\n1\n0\n-1\n-2\n-4\n131\n123\n10 7\n-4\n-(...TRUNCATED)	{"input":["51 89 97\n18 25 63\n22 91 74\n","1 100 1\n100 100 100\n1 100 100\n","20 1 1\n100 100 100\(...TRUNCATED)	{"input":["72\n111101100111001110000000100010100000111011100110001010111010101011111100\n","3\n001\n(...TRUNCATED)	2	7	{"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":[4,3,3,4,4,2,2,4,3,1,2,4,2,3,4,2,3,1,4,3,2,2,3,4,3,2,3,2,3,2,4,4,3,2,2,2,2,2,2,4,2,4,2,3(...TRUNCATED)	0		0	3,000	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p04048 AtCoder Grand Contest 001 - Mysterious Light	"An established group of scientists are working on finding solution to NP hard problems. They claim (...TRUNCATED)	{ "input": [ "2\n2 9 17\n1 1\n\nSAMPLE" ], "output": [ "Yes\nNo\n" ] }	{"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":["8 15\n","6 1\n","8 9\n","500 17172\n","5 2\n","5 9\n","2 7\n","3 15\n","61 249001\n","8 5(...TRUNCATED)	2	7	{"language":[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,2,2,4,4,4,2,2,4,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,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(...TRUNCATED)	1,088		500	0	[ "math" ]	false		{ "nanos": 0, "seconds": 2 }	0
805_A. Fake NP	"Golu is given a task of clearing coins fallen down on floor. Naughty being his modus operandi, he (...TRUNCATED)	{ "input": [ "2008 2 29\n2015 3 1", "1999 9 9\n2001 11 3" ], "output": [ "8", "3" ] }	{ "input": [], "output": [] }	{"input":["53812 5 967428361\n","12 2 400166453\n","27203 10 802338989\n","59715 12 196344479\n","14(...TRUNCATED)	2	7	{"language":[2,3,2,4,3,3,3,1,3,2,3,3,3,3,2,3,3,3,3,2,2,3,3,1,4,3,3,2,3,2,2,3,3,3,3,3,4,4,3,3,4,3,2,3(...TRUNCATED)	{"language":[3,2,2,2,3,3,2,2,3,0,3,2,3,2,3,3,0,4,2,2,2,3,2,2,0,2,4,4,0,2,0,3,2,2,3,3,3,3,2,2,0,0,2,2(...TRUNCATED)	0	F	2,000	2,400	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
178_A1. Educational Game	"You are given an integer n. In one move, you can either multiply n by two or divide n by 6 (if it i(...TRUNCATED)	{"input":["6 6\n1 2 2 1 2\n2 3 1 3\n3 4 2 4 5\n4 5 0\n5 3 1 3\n6 1 1 6\n","6 6\n1 2 2 1 2\n2 3 1 3\n(...TRUNCATED)	{"input":["10 9\n7 9\n8 9\n8 2\n10 6\n8 3\n9 4\n2 6\n8 5\n9 1\n","2 1\n1 2\n","20 20\n1 9\n11 9\n3 5(...TRUNCATED)	{"input":["2 2\n6 3\nMonday Tuesday Wednesday\n8 4\nThursday Friday Saturday Sunday\n2 2\n7 3\nMonda(...TRUNCATED)	6	12	{"language":[2,4,2,2,2,3,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,3,2,4(...TRUNCATED)	{"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],"solution":["#include <bits/stdc++.h(...TRUNCATED)	0	B	1,500	800	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0