Datasets:

TheFactoryX
/

edition_1235_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
1149_E. Election Promises	"Modern researches has shown that a flock of hungry mice searching for a piece of cheese acts as fol(...TRUNCATED)	{"input":["15\nyamatonadeshiko\n10\n1 a\n2 a\n3 a\n4 a\n5 a\n1 b\n2 b\n3 b\n4 b\n5 b\n","6\nkoyomi\n(...TRUNCATED)	{"input":["10000 10 100\n2339 4118 4595 5499 5582 6055 8693 9002 9190 9658\n10 75 82 5 14 55 64 68 4(...TRUNCATED)	{"input":["100 3\n2 1 1 1 3 2 3 3 2 3 3 1 3 3 1 3 3 1 1 1 2 3 1 2 3 1 2 3 3 1 3 1 1 2 3 2 3 3 2 2 3 (...TRUNCATED)	2	10	{"language":[4,3,4,3,3,4,3,4,2,4,4,3,1,2,4,3,4,4,2,3,3,3,2,4,4,4,4,3,3,3,2,2,4,4,1,3,4,4,2,2,3,3,2,3(...TRUNCATED)	{"language":[2,0,0,2,2,2,2,2,2,2,0,0,0,0,2,2,0,3,0,0,0,0,2,2,0,2,2,2,2,0,2,2,2,0,0],"solution":["#in(...TRUNCATED)	284		0	2,300	[ "" ]	false	"Problem\n\nマイヅ大学にある大規模クラスタ†型スーパーコンピュータ（通(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	1,073,741,824
p00167 Bubble Sort	"Some time ago Mister B detected a strange signal from the space, which he started to study.\n\nAfte(...TRUNCATED)	{"input":["2\n1 2\n1 2\n","4\n100 42\n42 100\n5 42\n100 5\n","3\n1 2\n2 4\n3 4\n"],"output":["0\n","(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10 2 6\n1 2\n1 4\n2 1 8\n2 9 2\n1 2\n1 9\n2 3 5\n1 8\n","10 5 2\n1 2\n1 3\n2 4\n2 5\n1 6\(...TRUNCATED)	2	8	{"language":[3,3,4,2,2,3,4,4,2,2,2,4,3,3,3,4,1,4,2,3,2,3,4,2,2,4,2,2,4,3,4,2,3,2,4,2,4,2,2,3,2,1,3,4(...TRUNCATED)	{"language":[2,2,4,2,2,2,4,4,2,4,2,2,2,2,2,4,2,2,4,3,4,4,4,4,1,4,4,4,2,3,1,4,2,2,2,2,4,4,2,4,1,3,2,2(...TRUNCATED)	0	D2	1,000	1,600	[ "" ]	false		{ "nanos": 500000000, "seconds": 2 }	256,000,000
substrings-count-3	"This is a simple game you must have played around with during your school days, calculating FLAMES (...TRUNCATED)	{"input":["5\n42\n17\n444\n7\n51\n"],"output":[" (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\nfdSgAe\nOut\nGet\n\nSAMPLE","3\nfdSgAe\ntuO\nFet\n\nSAMPLE","3\nBdSgfe\ntuO\nFet\n\nSA(...TRUNCATED)	1	11	{"language":[2,2,2],"solution":["#include<bits/stdc++.h>\nusing namespace std;\ndouble EPS=1e-9;\nst(...TRUNCATED)	{"language":[2,2,2,4,2,4,2,2,4,2,2,2,2,4,2,4,2,2,2,4,2,2,2,4,2,2,2,4,2,4,4,2,2,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,208		0	0	[ "binary search", "dsu", "graphs", "shortest paths", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	0
272_B. Dima and Sequence	"Polycarp has recently created a new level in this cool new game Berlio Maker 85 and uploaded it onl(...TRUNCATED)	{"input":["3 8 41\n1 3 2\n1 6 4 3 5 7 2 8\n","1 2 31\n1\n1 2\n","4 2 4\n4 2 3 1\n2 1\n"],"output":["(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["9 3 23\n9 3 22\n10 3 28\n16 10 107\n20 8 102\n20 10 105\n20 10 155\n3 5 3\n4 2 11\n0 0 0"(...TRUNCATED)	2	11	{"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,4,4,3,2,2,2,2,3,4,4,4,4,2,2,4,3,4,2,3,4,2,2,4,1,2,2,1,2,4,4,3,2,3,2,4,4,2,4,2,1,4,1,2(...TRUNCATED)	830	A	1,750	1,200	[ "bitmasks", "dp", "games" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1129_D. Isolation	"Peter got a new snow blower as a New Year present. Of course, Peter decided to try it immediately. (...TRUNCATED)	{ "input": [ "keyence", "ashlfyha", "keyofscience", "mpyszsbznf" ], "output": [ "YES", "NO", "YES", "NO" ] }	{ "input": [], "output": [] }	{"input":["2 2 1\n1 1 1 1\n","5 5 20\n3 1 3 3\n1 2 2 2\n4 3 4 2\n3 2 2 2\n3 4 2 4\n4 1 4 5\n4 3 5 3\(...TRUNCATED)	2	7	{"language":[3,2,4,4,2,4,4,4,3,3,3,2,3,3,4,3,3,2,4,4,2,4,4,1,3,1,4,3,1,1,2,3,3,4,2,1,2,2,4,2,2,4,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,4,3,2,2,3,2,2,2,2,2,2,2,2,4,3,2,2,2,2,1,2,4,2,2,2,2,2,4,2,2,3,1(...TRUNCATED)	1,100	C	500	2,600	[ "dfs and similar", "dp", "dsu", "ternary search", "trees" ]	false		null	512,000,000
p02610 AIsing Programming Contest 2020 - Camel Train	"problem\n\nAOR Ika is studying to pass the test.\n\nAOR Ika-chan solved the $ N $ question. After t(...TRUNCATED)	{"input":["6 5\n20 15 10 15 20 25\n","7 1\n101 53 42 102 101 55 54\n","7 1000000\n1 1 1 1 1 1 1\n"],(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n2\n1 5 10\n2 15 5\n3\n2 93 78\n1 71 59\n3 57 96\n19\n19 23 16\n5 90 13\n12 85 70\n19 6(...TRUNCATED)	2	8	{"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,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	{"language":[2,4,4,2,2,2,2,1,2,2,1,2,3,2,2,2,2,2,1,2,1,2,1,1,2,2,2,2,2,4,2,2,2,2,1,3,2,2,3,4,2,1,4,2(...TRUNCATED)	0		0	0	[ "math" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
xenny-and-range-sums	"Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is ex(...TRUNCATED)	{ "input": [ "2\n2 999995\n", "3\n2 3 9\n" ], "output": [ "5\n", "8\n" ] }	{ "input": [], "output": [] }	{"input":["5 6\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED)	6	6	{"language":[3,3,3,3,3,3,3,3,3,3,2,3,3,3,1,3,3,3,3,3,3,3,3,3,3,3,4,3,3,3,3,3,3,1,3,3,1,3,3,3,4,3,3,3(...TRUNCATED)	{"language":[3,2,0,2,0,2,2,3,0,2,2,2,3,2,2,3,2,2,2,2,2,2,4,4,2,2,2,3,3,2,2,3,2,2,3,3,3,2,3,2,2,0,3,2(...TRUNCATED)	643		0	2,700	[ "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
bogosort	"BCPC stands for Byteforces Collegiate Programming Contest, and is the most famous competition in By(...TRUNCATED)	{"input":["4\n10 4\n4 5\n5 2\n2 1\n1 3\n1 9\n9 10\n2 7\n7 8\n5 6\n4 3\n1 2\n2 3\n3 4\n5 3\n1 2\n1 3\(...TRUNCATED)	{"input":["4 9\n5 1000000000 999999999 12\n","4 6\n5 1000000000 999999999 12\n","1 1\n4\n","3 5\n4 5(...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	0	{"language":[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,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	{"language":[2,3,4,2,3,3,2,4,4,2,3,4,4,3,2,4,2,4,2,4,4,4,2,3,3,2,3,2,4,2,2,4,2,3,2,3,2,4,3,2,3,3,4,4(...TRUNCATED)	1,391	F	0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1091_G. New Year and the Factorisation Collaboration	"Chef had a hard time arguing with his friend, and after getting a great old kick Chef saw a colored(...TRUNCATED)	{ "input": [ "1 -5 6\n" ], "output": [ "2\n2.000000\n3.000000\n" ] }	{ "input": [ "60 0 58", "7 3 7" ], "output": [ "630738177", "195634923" ] }	{"input":["2 8","9 5","7 10","3 8","9 8","7 7","6 8","7 9","7 8","7 3","7 2","9 2","9 4","9 6","5 6"(...TRUNCATED)	2	12	{"language":[2,4,2,4,4,2,2,2,4,4,3,2,4,3,3,4,2,4,2,4,3,4,3,4,3,2,1,4,3,1,3,3,2,2,3,3,2,4,2,3,2,2,4,4(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,3,4,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,4,2(...TRUNCATED)	737		0	0	[ "" ]	true		null	256,000,000
1208_D. Restore Permutation	"Two coordinates (a1, a2) and (b1, b2) on a two-dimensional grid of r × c are given. The cost of mo(...TRUNCATED)	{ "input": [ "27", "6" ], "output": [ "5", "2" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	8	{"language":[2,2,2,2,2,2,4,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,4,2(...TRUNCATED)	{"language":[2,2,2,0,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,0,0,0,2,0,2,2,2,2,0,2,2,0,2,2,0,2,2,2,2,0,2,0,2,2(...TRUNCATED)	0		0	2,100	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000