Datasets:

TheFactoryX
/

edition_2050_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
1100_D. Dasha and Chess	"The rebels have saved enough gold to launch a full-scale attack. Now the situation is flipped, the (...TRUNCATED)	{ "input": [ "0 0\n1 1\n1 1\n", "0 0\n1 1\n0 1\n", "0 0\n1 1\n2 2\n" ], "output": [ "YES\n", "YES\n", "NO\n" ] }	{"input":["4\n39 20\n183 11\n551 27\n85 16","8\n4 65\n5 12\n7 24\n9 38\n12 24\n14 10\n65 75\n31 26"](...TRUNCATED)	{"input":["10000\n5000 3150\n5000 5000\n0 0\n5000 1050\n5000 3980\n5000 210\n5000 5000\n5000 5000\n0(...TRUNCATED)	6	10	{"language":[2,2,2,2,2,4,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,100		3,000	2,600	[ "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
500_C. New Year Book Reading	"PCK, which recycles Aizu's precious metal, Aizunium, has a network all over the country and collect(...TRUNCATED)	{"input":["5 2\n3 1 5 4 2\n5 2\n5 4\n","3 3\n3 1 2\n1 2\n3 1\n3 2\n","2 1\n1 2\n1 2\n"],"output":["1(...TRUNCATED)	{"input":["3 14\n8 9\n10 7\n","12 11\n11 12\n16 7\n","12 17\n10 19\n13 16\n","9 12\n3 17\n10 10\n","(...TRUNCATED)	{"input":["999 999\n1 1\n1 2\n2 1\n2 2\n1 3\n2 0\n<...>\n26 13\n26 14\n26 15\n26 16\n\n1 700 8(...TRUNCATED)	2	0	{"language":[1,1,1],"solution":["for _ in range(input()):\n try:\n eval(raw_input())\n (...TRUNCATED)	{"language":[2,2,2,2,2,2,2,0,2,2,2,0,3,2,2,3,2,4,0,2,2,2,2,0,2,2,2,2,4,2,2,2,2,2,0,2,2,2,2,2,2,3,2,2(...TRUNCATED)	990	C	1,500	2,000	[ "brute force", "greedy", "implementation", "math" ]	false	"あるところに、高い塀に囲まれた大きなお屋敷がありました。そのお屋敷(...TRUNCATED)	null	256,000,000
lucky5	"A chessboard n × m in size is given. During the zero minute we repaint all the black squares to th(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	{"input":["010\n"],"output":["1 2 3 4 5 6 7 8 9 \n2 4 6 8 10 12 14 16 18 \n3 6 9 12 15 18 21 24 27 \(...TRUNCATED)	2	6	{"language":[3,2,3,2,2,3,3,3,3,4,4,2,3,3,4,2,3,4,2,3,2,2,3,2,2,3,4,2,2,3,3,3,3,3,2,2,2,3,4,3,3,2,1,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)	70	B	0	1,400	[ "dp", "graphs", "greedy", "math", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p00167 Bubble Sort	"Problem\n\nTomorrow is finally the day of the excursion to Maizu Elementary School. Gatcho, who att(...TRUNCATED)	{ "input": [ "4\n10 21\n31 10\n0 1\n10 30\n" ], "output": [ "First\nSecond\nSecond\nFirst\n" ] }	{"input":["264193194 -448876521 736684426 -633906160 -328597212 -47935734\n","-357531221 381512519 -(...TRUNCATED)	{"input":["6\n773209925 62005863 473635171 329666981 510631133 207643327\n","1\n2\n","7\n481003311 5(...TRUNCATED)	2	6	{"language":[2,2,2,2,2,2,2,2,2,3,2,2,2,2,4,2,2,2,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,3(...TRUNCATED)	{ "language": [], "solution": [] }	1,374		0	2,000	[ "binary search", "math" ]	false	"太郎君はかけざんを習いたての小学生です。なんとなく、彼はかけざんを(...TRUNCATED)	{ "nanos": 0, "seconds": 5 }	256,000,000
proposal	"Polycarp has recently created a new level in this cool new game Berlio Maker 85 and uploaded it onl(...TRUNCATED)	{"input":["3\n1 0 1\n0 0 0\n","2\n1 4\n2 3\n","3\n0 0 0\n0 0 0\n"],"output":["0 0 1 \n1 0 0 ","1 3\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["+--+-+\n","+--+--+------+++++++-+-+++--++---+--+-+---+--+++-+++-------+++++-+-++++--+-+-+(...TRUNCATED)	2	11	{"language":[2,4,3,3,3,2,2,4,3,3,3,3,3,2,4,3,4,4,3,3,3,3,3,4,2,4,1,4,3,2,1,3,4,3,3,2,3,3,2,4,3,3,3,3(...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	E	0	2,500	[]	false	"Problem\n\n明日はいよいよマイヅ小学校の遠足の日である。マイヅ小学校に(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000
1402_A. Fancy Fence	"Your friend Jeff Zebos has been trying to run his new online company, but it's not going very well.(...TRUNCATED)	{ "input": [ "5\n0 1\n1 0\n0 1\n1 1\n0 1\n" ], "output": [ "3\n" ] }	{ "input": [], "output": [] }	{"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)	3	8	{"language":[4,2,2,2,2,2,4,4,2,4,2,2,2,4,2,4,4,2,2,2,2,4,2,2,2,2,2,1,2,3,2,4,2,1,2,2,3,3,4,4,2,2,2,2(...TRUNCATED)	{"language":[2,3,4,3,0,2,2,4,2,0,3,0,3,0,3,3,2,0,2,2,2,2,2,0,0,3,2,2,2,2,2,2,3,2,3,2,4,2,2,3,0,2,2,3(...TRUNCATED)	0	H	0	1,600	[ "implementation", "math" ]	false		null	512,000,000
insect-colony-2	"Two players are playing a game. The game is played on a sequence of positive integer pairs. The pla(...TRUNCATED)	{"input":["4\n2 1 2 3 4 3 2 6 1 1 2 2 1 2 3 2\n","1\n42\n","2\n1 1 1 1\n"],"output":["6 4 3 2 ","42 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4 0\n","8 9\n1 2\n2 3\n3 4\n4 1\n5 6\n6 7\n7 1\n8 5\n6 8\n","11 9\n5 9\n8 5\n11 3\n11 1\n(...TRUNCATED)	2	9	{"language":[4,4,1,4,2,4,4,1,4,1,3,2,2,3,1,4,1,4,3,3,4,4,3,2,3,1,2,4,2,3,1,4,4,3,3,2,4,4,2,4,1,2,3,4(...TRUNCATED)	{ "language": [], "solution": [] }	938	A	0	2,400	[ "number theory" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
p02548 AtCoder Beginner Contest 179 - A x B + C	"In the town of Aalam-Aara (meaning the Light of the Earth), previously there was no crime, no crimi(...TRUNCATED)	{ "input": [ "3\n1\n2 3\n2\n4 5\n5 6\n2\n2 3\n3 5" ], "output": [ "NO\nNO\nYES" ] }	{ "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	7	{"language":[2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\n\n#pragma GCC optimize(\"O3\")\(...TRUNCATED)	{"language":[2,2,0,2,2,3,2,2,2,2,3,2,2,2,2,2,3,2,2,2,3,2,2,3,2,0,2,3,2,3,2,2,3,2,3,0,0,2,2,2,2,3,2,4(...TRUNCATED)	405		0	3,100	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
45_H. Road Problem	"Today, Osama gave Fadi an integer X, and Fadi was wondering about the minimum possible value of max(...TRUNCATED)	{"input":["1\n0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0\n7\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n1 0 0 0 0 0 1 0 0(...TRUNCATED)	{"input":["3\n7089544 9134148 -5332724\n368810 1638695 7889905\n-3866235 -4257263 5802154\n","16\n-3(...TRUNCATED)	{ "input": [], "output": [] }	1	10	{"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,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)	319		0	0	[ "dfs and similar", "dp", "games", "graphs" ]	true		{ "nanos": 0, "seconds": 2 }	256,000,000
1007_E. Mini Metro	"Snuke has decided to play a game, where the player runs a railway company. There are M+1 stations o(...TRUNCATED)	{"input":["1 1\n4 10 0 0 10 0 10 10 0 10\n-5 -20 30 15\n135 45\n0 -15 15 0\n0 0"],"output":["11.213"(...TRUNCATED)	{"input":["5 3\n","1500 2000\n","500 1000\n","1000 1000\n","5 5\n","2000 2\n","1000 500\n","3 1000\n(...TRUNCATED)	{"input":["5\n90 94\n26 25\n64 84\n18 6\n20 96\n","5\n1912 1\n5 6\n999 1\n88 2\n11 100\n","5\n90 94\(...TRUNCATED)	2	11	{"language":[2,2,4,1,1,2,4,1,4,2,2,2,2,4,2,2,2,2,3,1,4,2,4,2,1,4,2,2,2,1,1,2,2,2,1,4,1,4,4,2,1,4,2,4(...TRUNCATED)	{"language":[2,2,2,2,2,4,3,3,4,4,4,2,1,4,4,2,2,2,2,3,1,2,4,4,4,4,2,3,2,3,2,1,2,4,4,4,3,4,3,2,4,2,4,2(...TRUNCATED)	0		0	0	[ "dfs and similar", "dp", "dsu", "ternary search", "trees" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000