Datasets:

TheFactoryX
/

edition_0574_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
724_F. Uniformly Branched Trees	"Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same(...TRUNCATED)	{ "input": [ "2\n" ], "output": [ "25\n" ] }	{"input":["5\n81 125 16\n19683 15625 8192\n59049 15630 32768\n59050 78125 131072\n177147 390625 1310(...TRUNCATED)	{"input":["72\n111101100111001110000000100010100000111011100110001010111010101011111100\n","3\n001\n(...TRUNCATED)	2	0	{"language":[3,2,2,4,2,2,2,4,3,3,4,4,4,4,2,2,4,2,1,2,2,3,3,4,1,4,4,4,3,3,3,4,3,3,2,2,2,2,2,2,3,4,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	A	0	2,100	[ "dp", "implementation", "math", "number theory" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
556_C. Case of Matryoshkas	"You are given the array a consisting of n elements and the integer k ≤ n.\n\nYou want to obtain a(...TRUNCATED)	{ "input": [ "500 100 1000", "19 123 143", "19 123 142", "50 100 120" ], "output": [ "No", "No", "Yes", "Yes" ] }	{"input":["1 3 0\n6 3 4\n","5 4 32\n4 2 1 1\n","32 6 635\n3 4 2 1 7 7\n","3 7 20012\n1 1 1 1 1 1 100(...TRUNCATED)	{"input":["5\n0 968804136\n0 736567537\n2 343136264\n0 259899572\n1 103950505\n","5\n0 51690939\n0 6(...TRUNCATED)	2	11	{"language":[2,4,1,2,2,2,4,4,2,2,4,4,2,2,2,2,2,2,2,2,3,2,4,1,2,2,2,2,2,2,2,1,2,2,2,1,4,2,3,2,2,2,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	0	C	0	2,400	[ "data structures", "greedy", "two pointers" ]	false		{ "nanos": 500000000, "seconds": 0 }	0
find-the-nth-prime	"James Bond has a new plan for catching his enemy. There are some cities and directed roads between (...TRUNCATED)	{ "input": [ "3 1 8 10\n10 8\n5 7\n11 9\n3\n", "2 2 10 18\n10 4\n20 6\n5 3\n" ], "output": [ "10\n", "20\n" ] }	{"input":["8 10\ncwcwcwcwcw\ncrcrcrcrcr\ncwcwcwcwcw\ncrcrcrcrcr\ncwcwcwcwcw\ncrcrcrcrcr\ncwcwcwcwcw\(...TRUNCATED)	{"input":["2\n1 222168095\n1000000000 1000000000\n","35\n1 7\n3 11\n6 12\n7 6\n8 5\n9 11\n15 3\n16 1(...TRUNCATED)	2	0	{"language":[2,2,4,2,2,3,4,2,2,2,1,2,4,2,2,4,4,2,2,2,4,4,2,2,4,2,2,2,4,2,4,2,2,2,2,2,1,4,2,2,4,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,0,3,2,2,4,2,2,0,2,2,2,2,4,3,2,2,3,2,0,2,2,2,0,2,0,2,2,0,4,2,2,3,2,2,2,2,2(...TRUNCATED)	0		50	2,000	[]	false		{ "nanos": 0, "seconds": 6 }	256,000,000
1007_E. Mini Metro	"In the game Lizard Era: Beginning the protagonist will travel with three companions: Lynn, Meliana (...TRUNCATED)	{"input":["9 6\n1 2 3 4 5 6 7 8 9\n1 4\n4 7\n2 5\n5 8\n3 6\n6 9\n"],"output":["7 8 9 4 5 6 1 2 3 \n"(...TRUNCATED)	{"input":["10 7\n1 10\n2 10\n3 10\n4 10\n5 10\n1 2\n1 3\n1 4\n1 5\n1 6\n","2 2\n1 1\n1 1\n","20 12\n(...TRUNCATED)	{"input":["5\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 2\n1 1\n1 1\n3\n1 100\n1 1\(...TRUNCATED)	2	11	{"language":[3,3,3,3,4,1,3,1,3,4,2,3,2,3,3,4,3,1,2,4,1,3,4,4,4,3,2,2,3,4,4,2,4,2,2,4,3,3,2,3,3,2,3,3(...TRUNCATED)	{"language":[2,2,2,2,2],"solution":["#include <iostream>\n#include <cstdio>\n#include <vector>\n#inc(...TRUNCATED)	0		0	0	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1129_A2. Toy Train	"You want to go on a trip with a friend. However, friends who have a habit of spending money cannot (...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":["5\n42\n17\n444\n7\n51\n"],"output":[" (...TRUNCATED)	{"input":["10\n100000000 200000000 300000000 28 500000000 600000000 700000000 800000000 900000000 10(...TRUNCATED)	5	9	{"language":[2,2,2,2,2,2,2,2,3,3,4,2,2,2,4,4,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,2,2,4,1,3,4,4,2,2,4(...TRUNCATED)	{ "language": [], "solution": [] }	20	A	0	2,000	[ "games", "graphs" ]	false		null	1,073,741,824
1144_B. Parity Alternated Deletions	"Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtu(...TRUNCATED)	{"input":["3\n0 10 4\n10 0 4\n20 10 4\n"],"output":["(((0((1-abs((t-0)))+abs((abs((t-0))-1))))+(5((...TRUNCATED)	{"input":["1 1 1 2\n5\n1000000000 1 10000\n19920401 1188 5566\n1000000000 1 10000\n1 1 10000\n5 100 (...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	9	{"language":[3,4,4,4,4,2,2,3,4,4,2,4,2,4,1,4,2,4,3,3,1,4,4,2,2,1,4,4,4,4,4,2,2,3,4,4,4,3,4,4,2,4,4,4(...TRUNCATED)	{"language":[4,4,2,1,2,3,2,4,3,4,3,3,4,2,3,3,3,3,2,4,3,3,3,4,4,2,3,2,3,4,2,2,2,4,2,3,2,3,4,3,2,3,3,3(...TRUNCATED)	0	C	2,000	0	[ "*special" ]	false		{ "nanos": 0, "seconds": 3 }	268,435,456
593_C. Beautiful Function	"Some time ago Mister B detected a strange signal from the space, which he started to study.\n\nAfte(...TRUNCATED)	{ "input": [ "4 5\n10 4 18 3\n", "2 2\n1 2\n" ], "output": [ "4", "1" ] }	{ "input": [], "output": [] }	{"input":["1\n1\n3\n2\n","3\n1 1 2\n1 0 3\n1 1 4\n","3\n1 1 101\n1 2 1\n1 2 1\n","8\n148933105 19040(...TRUNCATED)	2	2	{"language":[2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,4,2,4,2,4,2,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2(...TRUNCATED)	235	E	0	0	[ "binary search", "brute force", "chinese remainder theorem", "math", "number theory" ]	false	"20XX年に喜多方市熱塩加納町から南会津町までの6区間、総距離58kmの会津中(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
1096_E. The Top Scorer	"A new type of mobile robot has been developed for environmental earth observation. It moves around (...TRUNCATED)	{"input":["2 3\n1 2\n1 2\n1 2\n","5 7\n2 4\n5 1\n2 3\n3 4\n4 1\n5 3\n3 5\n"],"output":["5 6 ","10 9 (...TRUNCATED)	{"input":["100\n95 54 23 27 51 58 94 34 29 95 53 53 8 5 64 32 17 62 14 37 26 95 27 85 94 37 85 72 88(...TRUNCATED)	{"input":["? + ? + ? + ? + ? + ? + ? + ? + ? + ? - ? = 9\n","? - ? = 2\n","? = 1000001\n","? - ? + ?(...TRUNCATED)	5	0	{"language":[2,2,2,2,2,2,2,2,2,3,3,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,4,2,2,2,2,2,4,2,3(...TRUNCATED)	{"language":[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,2,2,2,3,2,2,2,2,2,3,4,2,2,2,2,2,4(...TRUNCATED)	1,144	D	500	2,000	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
p02943 AtCoder Grand Contest 037 - Reversing and Concatenating	"Sarah is a girl who likes reading books.\n\nOne day, she wondered about the relationship of a famil(...TRUNCATED)	{ "input": [ "5\n2 3 4 6 8" ], "output": [ "1" ] }	{ "input": [], "output": [] }	{"input":["1\n7\n.......\n.*.....\n.......\n.......\n.......\n.......\n.......\n\nSAMQLE","1\n5\n...(...TRUNCATED)	2	10	{"language":[1,2,2,2,2,4,2,4,4,2,2,3,2,4,2,2,1,2,2,4,4,2,2,3,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,2,2,1,2,2,2,1,3,2,2,2,1,2,2,3,2,3,2,2,2,2,2,2,2,2,2,2,3,2,2,4,4,3,2,2,3,2(...TRUNCATED)	0	G	750	0	[ "combinatorics", "dfs and similar", "dsu", "graphs" ]	false		{ "nanos": 0, "seconds": 6 }	256,000,000
brcktsrm	"Dima and Inna love spending time together. The problem is, Seryozha isn't too enthusiastic to leave(...TRUNCATED)	{ "input": [ "ah\n1\nha\n", "ya\n4\nah\noy\nto\nha\n", "hp\n2\nht\ntp\n" ], "output": [ "YES", "YES", "NO" ] }	{ "input": [], "output": [] }	{"input":["aabbaaaa\nbaaaaaab\n","cba\ncba\n","xnahfslefuigq\naaaaaaaaaaaaa\n","abcddd\ndddcab\n","a(...TRUNCATED)	2	2	{"language":[2,3,2,2,2,2,2,2,2,2,2,2,2,4,2,2,3,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,4,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,1,2,4,1,4,3,1,2,4,3,1,4,2,2,3,2,4,2,2,4,4,3,4,3,2,4,1,1,4,1,3,4,2,3,3,1,3,2,4,2,4,4(...TRUNCATED)	1,003	B3	0	1,400	[ "dp", "implementation", "strings" ]	false		{ "nanos": 0, "seconds": 8 }	256,000,000