Datasets:

TheFactoryX
/

edition_1295_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
1110_E. Magic Stones	"Step up and down\n\nKazuki, commonly known as Kerr, who attends JAG University, was invited by your(...TRUNCATED)	{"input":["6 7\n2 3\n3 4\n4 2\n1 2\n1 5\n5 6\n6 1\n","3 3\n1 2\n2 3\n3 1\n","5 6\n1 2\n2 3\n2 4\n4 3(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["qqqqqqqqqq qqqqqqqq\n3\nqqqqqqqq qqqqqqqqq\nqqqqqqqqq qqqqq\nqqqqq p\n","wwwww w\n8\nwwww(...TRUNCATED)	2	10	{"language":[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>\n\(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2(...TRUNCATED)	488	E	0	1,700	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
1391_C. Cyclic Permutations	"You are given a functional graph. It is a directed graph, in which from each vertex goes exactly on(...TRUNCATED)	{ "input": [ "2\n3\n10" ], "output": [ "1\n3" ] }	{ "input": [], "output": [] }	{"input":["1 10\n1 5 9 5\n1\n5 5 L 0\n","3 7\n2 4 2 7\n4 7 4 6\n7 3 5 3\n10\n6 7 L 1\n6 7 L 2\n6 7 L(...TRUNCATED)	5	8	{"language":[4,2,2,2,2,2,4,2,4,2,2,4,2,4,2,2,4,4,2,3,2,2,2,4,4,4,2,2,2,2,4,4,2,2,4,2,4,3,2,2,4,4,4,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,4,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,4,0,2,3,2,3,2(...TRUNCATED)	0	B	0	1,600	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
monks-birthday-party	"The year of 2012 is coming...\n\nAccording to an ancient choradrican legend in this very year, in 2(...TRUNCATED)	{ "input": [ "5 1\nbacba", "10 2\nbbaabbbaab" ], "output": [ "aabca", "aaaabbaabb" ] }	{ "input": [], "output": [] }	{"input":["176856\n","468424\n","371312\n","1559681\n","1362308\n","1165938\n","1001000\n","45859\n"(...TRUNCATED)	2	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":[3,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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0		0	0	[ "" ]	false		null	256,000,000
dbyz15t	"You are given a string s consisting of n characters. These characters are among the first k lowerca(...TRUNCATED)	{"input":["3 1\n1 100 1","12 5\n43 94 27 3 69 99 56 25 8 15 46 8","3 1000\n1 100 1","6 14\n25 171 7 (...TRUNCATED)	{"input":["xoox\n.xx.\no..o\n..xo\n","o.xx\nxo.o\n...o\n..x.\n","xxoo\no.oo\n...x\nx..x\n","o..x\n..(...TRUNCATED)	{"input":["3 3\n1 2\n1 2\n1 3\n","5 3\n2 1\n5 4\n3 2\n","20 5\n3 12\n5 20\n16 4\n13 2\n9 14\n","3 2\(...TRUNCATED)	2	15	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["n = int(raw_input())\nm = map(int, (...TRUNCATED)	{ "language": [], "solution": [] }	0		0	2,400	[ "dp", "greedy" ]	false		{ "nanos": 0, "seconds": 2 }	0
p00260 Cats Going Straight	"Edward R. Nelson is visiting a strange town for some task today. This city is built on a two-dimens(...TRUNCATED)	{"input":["22\n0011223344556677889988\n","11\n00000000008\n","11\n31415926535\n"],"output":["2\n","1(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["51\n1732111733638718702525811518175029394157760329139501\n","55\n815096522892298714932212(...TRUNCATED)	2	7	{"language":[4,2,3,4,2,2,4,3,4,3,2,4,4,2,1,2,2,4,2,2,2,2,4,4,3,2,4,3,2,2,2,2,4,4,2,2,4,2,2,4,2,4,4,2(...TRUNCATED)	{"language":[0,2,2,0,2,2,2,0,2,0,2,2,2,2,2,0,0,2,3,2,0,2,2,0,0,2,4,2,2,2,2,2,2,2,2,0,2,0,2,0,2,2,1,0(...TRUNCATED)	846	E	250	2,000	[ "data structures", "dfs and similar", "dp", "trees" ]	false		null	256,000,000
p03452 AtCoder Regular Contest 090 - People on a Line	"You are given a square board, consisting of n rows and n columns. Each tile in it should be colored(...TRUNCATED)	{"input":["2 1 0\n","2 2 4\n0 1 2 1\n0 1 2 1\n1 2 1 0\n1 1 1 2\n"],"output":["FIRST\n1 0 1 1\n","SEC(...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":["#(#(#((##((()))(((#)(#()#(((()()(()#(##(((()(((()))#(((((()(((((((()#((#((()(#(((()((*##((...TRUNCATED)	2	10	{"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,4,4,2,2,4,2,4,2],"solut(...TRUNCATED)	{"language":[4,4,4,3,2,4,4,2,2,4,2,4,2,4,4,3,4,2,2,4,2,2,4,1,2,4,2,4,4,2,2,2,2,2,3,4,3,4,2,3,2,3,3,4(...TRUNCATED)	1,525	B	1,250	0	[ "dfs and similar", "graphs" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
415_E. Mashmokh and Reverse Operation	"There are n persons who initially don't know each other. On each morning, two of them, who were not(...TRUNCATED)	{"input":["21\n\n7\n\n17\n\n15\n\n17\n\n11\n\n-1\n\n15\n\n"],"output":["+ 12 16\n\n- 6 10\n\n* 8 15\(...TRUNCATED)	{"input":["72\n111101100111001110000000100010100000011011100110001010111010101011111100\n","3\n101\n(...TRUNCATED)	{"input":["2\n4 INDIAN\nCONTEST_WON 1\nTOP_CONTRIBUTOR\nBUG_FOUND 100\nCONTEST_HOSTED\n1 NON_INDIAN\(...TRUNCATED)	6	0	{"language":[4,2,2,2,2,2,3,4,2,4,4,2,3,4,4,2,4,2,1,2,4,2,4,2,2,4,4,2,2,2,4,4,2,4,3,4,2,4,4,3,2,1,4,2(...TRUNCATED)	{"language":[4,4,2,1,2,4,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,1,2,2,2,2(...TRUNCATED)	0	B	1,000	3,000	[ "*special" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p02781 AtCoder Beginner Contest 154 - Almost Everywhere Zero	"Finally Fox Ciel arrived in front of her castle!\n\nShe have to type a password to enter her castle(...TRUNCATED)	{"input":["o.x.\no...\n.x..\nooxx\n","x.ox\nox..\nx.o.\noo.x\n","xx..\n.oo.\nx...\noox.\n","x..x\n..(...TRUNCATED)	{"input":["9\n","8\n","6\n","4\n","7\n","5\n","2\n"],"output":["1 2 3 4 5 6 7 8 \n2 4 6 8 (...TRUNCATED)	{"input":["1000\n999001\n999002\n999003\n999004\n999005\n999006\n999007\n999008\n999009\n999010\n999(...TRUNCATED)	6	13	{"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,2,2,2,2,2,2,2,2,3,2(...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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0		0	1,600	[ "" ]	false		null	256,000,000
405_E. Graph Cutting	"PowerShell had N natural numbers. He wanted to test Xenny's speed in finding the sum and difference(...TRUNCATED)	{ "input": [ "2\n1\n2" ], "output": [ "2\n5\n" ] }	{ "input": [], "output": [] }	{"input":["aaaa b","dcba cb","aa`a a","dcac dc","a``a a","b abab","aaaa c","dcba bc","b baba","aaa` (...TRUNCATED)	5	10	{"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],"solution":["# @author Kil(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	2,400	[ "" ]	false		null	1,073,741,824
lexicographically-preceding-permutation	"Integer factorisation is hard. The RSA Factoring Challenge offered $100 000 for factoring RSA-1024,(...TRUNCATED)	{"input":["5 7\nqcezchs\nhhedywq\nwikywqy\nqckrqzt\nbqexcxz\n3 2\n??\nyw\n?q\n","8 6\nibrgxl\nxqdcsg(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["9 1004498469 6\n","1 0 10\n","1944219055 33463955 1369298327\n","914835 4386500 9234739\n(...TRUNCATED)	2	0	{"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,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,1,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2(...TRUNCATED)	1,257	C	0	1,600	[]	false	"Background\n\n会津大学付属幼稚園はプログラミングが大好きな子供が集まる(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000