Datasets:

TheFactoryX
/

edition_1094_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	time_limit dict	memory_limit_bytes int64 0 1.07B
1211_I. Unusual Graph	"In Byteland, there are two political parties fighting for seats in the Parliament in the upcoming e(...TRUNCATED)	{"input":["5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\(...TRUNCATED)	{"input":["1\n10 2 20\n8 5 2 4 10 3 9 7 1 6\n5 10\n3 17\n6 31\n3 46\n10 42\n7 19\n9 36\n7 3\n3 13\n8(...TRUNCATED)	{"input":["3\nooe\n","36\naaiouyaaeeiioouuyyaaeeeeiiiooouuuyyy\n","3\npoo\n","1\nb\n","4\nooee\n","5(...TRUNCATED)	1	9	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include<iostream>\n#include<algo(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,4,4,2,2,4,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,4,2,4,2,2,2,2(...TRUNCATED)	1,506		0	800	[ "data structures", "greedy" ]	false	{ "nanos": 0, "seconds": 1 }	0
687_A. NP-Hard Problem	"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": [ "14 3 2012" ], "output": [ "Wednesday" ] }	{ "input": [], "output": [] }	{"input":["1\n782058266\n","7\n1\n2\n4\n12\n12345\n15116544\n387420489\n","7\n1\n2\n4\n24\n12345\n23(...TRUNCATED)	2	8	{"language":[2,2,2,4,2,2,3,3,4,3,4,3,3,2,4,4,1,3,4,4,1,3,2,4,2,2,2,4,3,3,3,2,4,2,2,3,1,2,2,4,3,4,4,3(...TRUNCATED)	{"language":[2,2,2,2,0,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],"solution":[(...TRUNCATED)	1,030		0	900	[]	true	{ "nanos": 0, "seconds": 2 }	0
p00720 Earth Observation with a Mobile Robot Team	"There are N people numbered 1 to N. Each person wears a red hat or a blue hat.\n\nYou are given a s(...TRUNCATED)	{ "input": [ "5\n0 0\n2 0\n1 1\n2 2\n0 2", "4\n0 0\n3 1\n2 3\n0 3" ], "output": [ "0", "1" ] }	{"input":["5\n12\n5 4 4 3 2 2 1 1 1 1 1 1\n4\n4 3 2 1\n1\n1000000\n20\n20 19 18 17 16 15 14 13 12 11(...TRUNCATED)	{"input":["5\n1 4 4 5 2","9\n1 2 4 9 5 8 7 6 6","9\n1 2 4 9 5 8 4 6 6","5\n0 4 4 5 1","2\n1 0","2\n1(...TRUNCATED)	5	0	{"language":[2,4,3,4,4,4,1,3,3,2,4,3,2,3,1,3,3,4,4,4,3,2,4,2,3,2,3,2,2,2,2,3,2,1,1,1,4,2,3,4,4,2,2,2(...TRUNCATED)	{"language":[2,2,2,4,2,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,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	B	0	2,500	[ "geometry", "math" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
1470_E. Strange Permutation	"Differential pulse code modulation is one of the compression methods mainly used when compressing a(...TRUNCATED)	{"input":["5 3\n1 2 3 4 0\n4 1 2 14 3\n","7 3\n1 2 3 4 3 2 6\n6 3 1 4 2 2 3\n","4 4\n0 1 2 3\n0 1 2 (...TRUNCATED)	{"input":["bbcbccbabcbabcbaaccccaaabcbcaacacbabbbbcabcbbbbacbcaccccbcccbccaaabcabacccbaccccbbababccb(...TRUNCATED)	{ "input": [], "output": [] }	2	12	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,4,4,2,2,2,4,2,2,4,4,4,2,4,1,4,2,2,1,4,4,2,2,2,2,2,2,4,4,4,2,2,2,3,4,2,1,2,4,2,4,4(...TRUNCATED)	0		2,000	1,800	[ "math" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
80_C. Heroes	"There are five people playing a game called \"Generosity\". Each person gives some non-zero number (...TRUNCATED)	{"input":["byebye","abcdefghijklmnopqrstuvwxyz","aabxyyzz","abcabcxabcx"],"output":["1","26","2","3"(...TRUNCATED)	{"input":["99\n1\n3\n2\n2\n3\n1\n1\n3\n3\n3\n3\n3\n3\n1\n1\n3\n3\n3\n3\n1\n1\n3\n2\n1\n1\n1\n1\n1\n1(...TRUNCATED)	{"input":["3703 4549\n433\n","2931 2881\n710\n","3762 947\n1073\n","4583 2774\n986\n","7 10\n1\n","1(...TRUNCATED)	2	0	{"language":[2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,3,2,3,3,3,3,3,2,3,3,3,3,4,4,3,3,2,3,3,3,3,3,3,2,3,3,3(...TRUNCATED)	{ "language": [], "solution": [] }	530	B	2,500	2,400	[ "greedy" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
p02879 AtCoder Beginner Contest 144 - 9x9	"Sasha reaches the work by car. It takes exactly k minutes. On his way he listens to music. All song(...TRUNCATED)	{"input":["5\n1 2\n2 1\n5 10\n10 9\n20 1\n","5\n1 2\n2 1\n5 10\n10 9\n19 1\n"],"output":["4\n","3\n"(...TRUNCATED)	{ "input": [ "2\nacxz\nbcxz" ], "output": [ "Funny\nNot Funny\n" ] }	{"input":["10\n100000000 200000000 300000000 28 500000000 600000000 700000000 800000000 900000000 10(...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":[2,2,1,4,3,3,3,2,4,2,2,3,3,4,4,4,3,3,3,3,4,2,3,2,3,2,2,2,2,3,3,1,4,4,3,2,2,4,4,3,2,3,2,2(...TRUNCATED)	1,264	C	0	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p00323 Metal Recycling	"Two-gram is an ordered pair (i.e. string of length two) of capital Latin letters. For example, \"AZ(...TRUNCATED)	{"input":["2\n1 1\n100 100\n","5\n10 30 5 6 24\n10 41 7 8 24\n","4\n3 3 4 3\n4 7 6 5\n"],"output":["(...TRUNCATED)	{"input":["1000\n999001\n999002\n999003\n999004\n999005\n999006\n999007\n999008\n999009\n999010\n999(...TRUNCATED)	{ "input": [], "output": [] }	2	10	{"language":[3,3,2,2,4,3,1,1,4,3,2,3,1,2,2,4,2,2,4,2,4,2,2,4,1,2,2,1,1,4,4,2,2,2,1,4,3,1,1,4,4,3,4,1(...TRUNCATED)	{"language":[2,4,4,3,2,3,2,2,3,2,3,3,4,3,4,4,4,2,2,2,4,2,4,4,3,2,3,1,4,2,3,4,3,2,2,2,2,4,2,2,3,2,2,2(...TRUNCATED)	0	E	0	1,900	[ "binary search", "math" ]	false	{ "nanos": 0, "seconds": 2 }	0
167_C. Wizards and Numbers	"Edward R. Nelson is visiting a strange town for some task today. This city is built on a two-dimens(...TRUNCATED)	{ "input": [ "3\nDSAWWAW\nD\nWA\n" ], "output": [ "8\n2\n4\n" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	11	{"language":[4,3,3,4,4,3,3,3,3,2,3,3,4,2,2,3,2,4,2,3,2,3,2,1,4,4,4,3,2,3,3,2,2,3,4,2,3,4,3,4,4,3,3,4(...TRUNCATED)	{"language":[1,3,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,4,4,2,4,3,1,2,1,2,1,2,4,4,2,2,2,4,4,2,4,4(...TRUNCATED)	1,446	E	0	0	[]	false	{ "nanos": 500000000, "seconds": 1 }	0
996_F. Game	"A recently found Ancient Prophesy is believed to contain the exact Apocalypse date. The prophesy is(...TRUNCATED)	{"input":["7 2\n-10 -4 -2 0 2 4 10","16 19\n-49 -48 -33 -30 -21 -14 0 15 19 23 44 52 80 81 82 84","3(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["xxoo\no.oo\nx...\nx..x\n","oo.x\nxo.o\nxx.o\n.oxx\n","xo..\nxo.x\no.xo\nxoox\n","..ox\n..(...TRUNCATED)	6	2	{"language":[1,1,1,1],"solution":["for t in xrange(input()):\n n, m = map(int, raw_input().strip((...TRUNCATED)	{ "language": [], "solution": [] }	0	C	0	1,800	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	1,073,741,824
p02652 AtCoder Grand Contest 045 - 01 Unbalanced	"Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclu(...TRUNCATED)	{ "input": [ "5 1\nbacba", "10 2\nbbaabbbaab" ], "output": [ "aabca", "aaaabbaabb" ] }	{"input":["4\n10 4\n15 1\n19 3\n20 1\n","2\n1 999999999\n1000000000 1000000000\n","67\n1 1\n3 8\n4 1(...TRUNCATED)	{"input":["6 4 3\n0 1 2\n2 3 0\n0 4 5\n1 4 4\n1 2 2\n0 4 2\n","5 1 7\n0 4 1\n0 10 5\n9 0 2\n9 0 0\n9(...TRUNCATED)	3	0	{"language":[3,3,3,3,4,1,3,3,1,4,4,2,4,3,3,3,3,3,2,2,2,1,4,1,2,1,3,3,1,3,1,3,3,2,1,1,3,4,1,3,1,2,2,4(...TRUNCATED)	{"language":[2,2,2,0,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(...TRUNCATED)	0	B3	1,000	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000