Datasets:

TheFactoryX
/

edition_1540_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
470_F. Pairwise Sums	"Vasya wants to turn on Christmas lights consisting of m bulbs. Initially, all bulbs are turned off.(...TRUNCATED)	{"input":["8\n3 1 4 1 5 9 2 6\n","5\n1 1 1 1 1\n","13\n2 7 1 8 2 8 1 8 2 8 4 5 9\n"],"output":["\n2\(...TRUNCATED)	{"input":["+-+--+-+\n","+-+--+\n","+-+++-\n","+++-\n","-++-+--++--+-++-\n","-+++--\n","-+--+-\n","+-(...TRUNCATED)	{"input":["100\n591 417 888 251 792 847 31 3 182 461 102 348 555 956 771 901 712 878 580 631 342 333(...TRUNCATED)	6	0	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["_ = int(raw_input())\nfor __ in range(...TRUNCATED)	{"language":[2,4,2,2,2,4,2,1,4,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,2,4,2,2,2(...TRUNCATED)	633		1,250	1,800	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p03013 AtCoder Beginner Contest 129 - Typical Stairs	"Wet Shark asked Rat Kwesh to generate three positive real numbers x, y and z, from 0.1 to 200.0, in(...TRUNCATED)	{"input":["341143514535\n314\n143565553551655311343411652235654535651124615163\n551544654451431564\n(...TRUNCATED)	{"input":["3\n500000 500001 500002\n","1\n505050\n","2\n999998 999999\n","2\n500000 500001\n","1\n99(...TRUNCATED)	{"input":["2\n3 3 2\n8 3 2\n3 0\n3 7\n8 0\n5 7","2\n3 3 2\n8 3 2\n1 3\n3 7\n8 0\n8 7","1\n10 10 17\n(...TRUNCATED)	2	14	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	0	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
268_A. Games	"Treeland consists of n cities and n-1 two-way roads connecting pairs of cities. From every city, yo(...TRUNCATED)	{ "input": [ "3\n1 2\n1 1\n2 1\n", "3\n1 3\n2 2\n3 1\n" ], "output": [ "1 3\n", "1 2 3\n" ] }	{ "input": [], "output": [] }	{"input":["1 11 4 0 10\n","17 10 12 6 8\n","6 4 4 0 2\n","50 4 5 5 -1\n","20 2 40 1 2\n","1000 501 5(...TRUNCATED)	2	8	{"language":[1],"solution":["t = int(raw_input())\nfor _ in range(t):\n\tn, a, b, c = map(int, raw_i(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	0		1,250	800	[ "" ]	false	"G: 運命力 - Destiny Draw -\n\n問題\n\nMr. D はカードゲームで勝負をすることに(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
p03774 AtCoder Beginner Contest 057 - Checkpoints	"Two students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs,(...TRUNCATED)	{ "input": [ "2 -3 4\nL 2 5\n? 3 5" ], "output": [ "2\nL 4\nL 3" ] }	{"input":["10 1000000\n1 2 3 4 84 5 6 7 8 9\n","1 1\n3\n","13 666\n84 89 29 103 128 233 190 122 117 (...TRUNCATED)	{"input":["10 20 11\njsnr u eq qas gcj rnnf fpb c dz g\n","10 10 19\nlguv zi riht pf jtbo qmj qp nvh(...TRUNCATED)	5	7	{"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":[4,3,2,2,2,2,4,1,2,2,2,3,1,3,3,1,2,3,2,4,4,2,3,3,4,1,4,3,3,2,4,4,2,3,2,2,2,4,2,3,2,3,2,2(...TRUNCATED)	1,540	A	0	0	[ "dfs and similar", "dp", "dsu", "ternary search", "trees" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
518_E. Arthur and Questions	"One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantens(...TRUNCATED)	{ "input": [ "7\n1 1 2 2 3 3 3\n", "10\n1 1 1 5 4 1 3 1 2 2\n", "1\n1\n" ], "output": [ "6\n", "7\n", "0\n" ] }	{ "input": [], "output": [] }	{"input":["4 4 3\n1 2 3\n1 2 1\n2 3 3\n1 3 3\n1 4 4\n","5 4 2\n4 5\n1 2 100\n1 3 100\n3 4 10\n3 5 20(...TRUNCATED)	1	0	{"language":[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,4,2,2,2,2,2,2,2,2,2,4,4,2,2(...TRUNCATED)	{"language":[2,2,0,0,0,3,2,2,0,4,0,1,2,0,3,1,0,2,0,2,2,2,4,2,0,0,0,4,2,0,2,0,2,0,2,4,3,0,3,2,3,4,0,0(...TRUNCATED)	1,101	D	2,250	0	[ "data structures", "dfs and similar", "dp", "graphs", "greedy", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
the-competitive-class-3	"Alice is playing with some stones.\n\nNow there are three numbered heaps of stones. The first of th(...TRUNCATED)	{ "input": [ "4\n100 100 100 200\n", "3\n100 200 100\n" ], "output": [ "NO\n", "YES\n" ] }	{ "input": [], "output": [] }	{"input":["384\n87 78 16 94 36 87 93 50 22 63 28 91 60 64 27 41 27 73 37 12 69 68 30 83 31 63 24 68 (...TRUNCATED)	3	9	{"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)	{"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	D	2,500	0	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
p02257 Prime Numbers	"You are given a positive integer m and two integer sequence: a=[a_1, a_2, …, a_n] and b=[b_1, b_2(...TRUNCATED)	{ "input": [ "7\n1\n2\n3\n4\n5\n100\n2000000\n" ], "output": [ "0\n0\n4\n4\n12\n990998587\n804665184\n" ] }	{ "input": [], "output": [] }	{"input":["0.2 0.1 1.448460702857607\n","1.0 200.44854766953543 1.0\n","0.3 1.3846300094261417 0.6\n(...TRUNCATED)	6	11	{"language":[3,2,2,3,1,2,2,2,2,2,4,3,4,3,3,2,4,4,2,1,4,3,4,4,1,3,2,4,2,3,2,3,3,4,4,3,2,4,4,2,4,2,2,3(...TRUNCATED)	{"language":[4,3,2,3,0,2,2,3,0,2,3,3,2,3,0,0,2,2,3,2,0,3,0,3,2,2,3,2,3,3,2,3,3,0,3,4,0,2,3,3,2,3,2,0(...TRUNCATED)	0	A	750	2,300	[ "data structures", "greedy" ]	false		{ "nanos": 0, "seconds": 3 }	134,217,728
1211_I. Unusual Graph	"Given a string s. Can you make it a palindrome by deleting exactly one character? Note that size of(...TRUNCATED)	{"input":["5 2 1\n0.1 0.2 0.3 0.4 0.5\n6 2 2\n0.1 0.2 0.3 0.4 0.5 0.6\n0 0 0"],"output":["0.01\n0.00(...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)	3	11	{"language":[2],"solution":["#include <algorithm>\n#include <cassert>\n#include <climits>\n#include (...TRUNCATED)	{"language":[2,2,2,4,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,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,037		0	0	[ "brute force", "greedy" ]	false		{ "nanos": 0, "seconds": 8 }	536,870,912
954_F. Runner's Problem	"You are given a binary matrix A of size n × n. Let's denote an x-compression of the given matrix a(...TRUNCATED)	{"input":["1500 2000 1600 3 2","1500 2000 500 90000 100000","1500 2000 1900 3 2"],"output":["7900","(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1\n7\n.......\n.*.....\n.......\n.......\n.......\n.......\n.......\n\nSAMQLE","1\n5\n...(...TRUNCATED)	1	8	{"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,1,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[3,2,2,2,2,3,2,3,3,4,3,4,2,4,2,3,4,2,4,2,4,2,2,2,2,3,4,2,2,2,3,3,4,3,3,4,2,2,3,1,2,2,2,4(...TRUNCATED)	0	B	500	0	[ "brute force", "greedy" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
45_H. Road Problem	"You are the God of Wind.\n\nBy moving a big cloud around, you can decide the weather: it invariably(...TRUNCATED)	{"input":["8\n1 2 100\n1 3 20\n2 4 2\n2 5 1\n3 6 1\n3 7 2\n6 8 5\n6\n1 8\n2 3\n5 8\n2 6\n4 7\n6 1\n"(...TRUNCATED)	{"input":["728961319347 33282698448966372 52437 42819\n","461788563846 36692905412962338 93797 64701(...TRUNCATED)	{"input":["6\n0 41 48 86 94 14\n41 0 1 30 59 39\n48 1 0 9 31 49\n86 30 9 0 48 30\n94 59 31 48 0 33\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,2,2,2,2,3,2,2,2,2,2,2],"solutio(...TRUNCATED)	{ "language": [], "solution": [] }	268	B3	0	3,000	[ "implementation", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000