Datasets:

TheFactoryX
/

edition_2711_deepmind-code_contests-readymade

name large_stringlengths 4 70	description large_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 large_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
470_C. Eval	"You have multiset of n strings of the same length, consisting of lowercase English letters. We will(...TRUNCATED)	{ "input": [ "2 2 1 0 0 1\n", "2 2 10 11 0 1\n", "2 4 3 -1 3 7\n" ], "output": [ "1", "5", "2" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	7	{"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,3,2,2,4,4,2,2,2,4,2,2,2,2,2,3,2,2,2,4,3,3,3,2,3,3,2,3,4,2,3,2,2,2,2,4,4,3,2,2,3,2,2(...TRUNCATED)	1,176	F	2,000	2,200	[ "" ]	false	{ "nanos": 0, "seconds": 4 }	256,000,000
464_D. World of Darkraft - 2	"AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is(...TRUNCATED)	{"input":["3\ncan you meet me outside ccd today\na\nthis year hard kaur is coming to entertain us"],(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["7 7 19\n#.....#\n..#.#..\n.#...#.\n...#...\n.#...#.\n..#.#..\n#.....#\n","4 6 3\n#.....\n(...TRUNCATED)	2	2	{"language":[2,3,2,2,2,2,4,3,3,3,3,2,2,2,2,2,3,2,2,2,3,2,2,2,2,3,1,3,3,3,2,4,3,2,4,3,4,2,2,3,2,2,2,2(...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,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	963	A	0	1,800	[ "data structures", "math" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p01353 Rabbit Plays Games!	"You are playing a strange game with Li Chen. You have a tree with n nodes drawn on a piece of paper(...TRUNCATED)	{ "input": [ "3 1 2 3\n", "1 3 2 3\n" ], "output": [ "5\n", "4\n" ] }	{ "input": [], "output": [] }	{"input":["3\n10 2 5\n12 4 8\n6 2 2\n\nSAMPLE","3\n7 2 5\n12 4 8\n6 2 2\n\nSAMPLF","3\n7 2 5\n12 4 8(...TRUNCATED)	2	0	{"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":[0,2,2,0,2,2,2,0,2,0,2,2,2,2,2,0,0,2,3,2,0,2,2,0,0,2,4,2,2,2,2,2,2,2,2,0,2,0,2,0,2,2,1,0(...TRUNCATED)	0	B	2,000	2,500	[ "dp", "implementation" ]	true	null	256,000,000
633_H. Fibonacci-ish II	"Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba(...TRUNCATED)	{ "input": [ "2\n3\n10" ], "output": [ "1\n3" ] }	{"input":["10\n669924290 408119795 804030560\n663737793 250734602 29671646\n431160679 146708815 2894(...TRUNCATED)	{"input":["58\n","138868\n","562984\n","359885\n","12\n","53728\n","252321\n","714009\n","38\n","439(...TRUNCATED)	2	7	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2],"solution":["#include <bits/stdc++.h>\nusing n(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,1,2,2,2,2,2,2(...TRUNCATED)	0		0	0	[ "" ]	true	{ "nanos": 0, "seconds": 4 }	1,073,741,824
746_F. Music in Car	"You want to perform the combo on your opponent in one popular fighting game. The combo is the strin(...TRUNCATED)	{ "input": [ "3\n1\n0 1\n0 0\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1" ], "output": [ "yes\nyes\nno\n" ] }	{ "input": [ "5\n1 14\n1 50\n4 28\n5 700\n3 147" ], "output": [ "1\n10\n3\n32491\n739" ] }	{"input":["1 10\n8\n1\n2\n3\n4\n5\n6\n7\n13\n9\n16\n","1 10\n2\n1\n2\n3\n4\n5\n6\n7\n8\n3\n16\n","1 (...TRUNCATED)	2	17	{"language":[2,2,2,2,2,4,4,4,2,2,2,2,4,2,2,2,2,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,2(...TRUNCATED)	{"language":[4,2,4,3,4,3,2,2,3,3,2,4,4,3,3,4,4,4,2,2,2,4,3,3,2,3,2,4,3,3,1,2,4,4,3,3,3,2,3,2,2,4,4,4(...TRUNCATED)	0		0	1,800	[ "divide and conquer", "fft", "greedy", "math", "number theory" ]	false	null	256,000,000
p00991 Grid	"Bob is travelling from one city to another. In his way, he sees many other cities pass by. What he (...TRUNCATED)	{"input":["9\ndo\nthe\nbest\nand\nenjoy\ntoday\nat\nacm\nicpc\n14\noh\nyes\nby\nfar\nit\nis\nwow\nso(...TRUNCATED)	{"input":["7879 2590 2818\n","78 28 27\n","9178 2255 7996\n","6571 6449 8965\n","6151 6148 3746\n","(...TRUNCATED)	{"input":["1 1\n1 1\n","0 3\n3 1\n","12 4\n4 4 2 1 3 1 1 3 4 1 4 4\n","10 2\n1 2 2 2 2 2 1 2 2 2\n",(...TRUNCATED)	2	7	{"language":[2,2,2,2,2],"solution":["\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define int (...TRUNCATED)	{"language":[2,2,2,2,4,2,4,2,4,2,2,2,4,2,2,2,3,2,2,2,2,2,0,2,2,2,4,2,2,4,2,0,2,2,2,2,1,0,2,2,1,2,2,2(...TRUNCATED)	545	B	0	0	[ "*special", "binary search" ]	false	null	256,000,000
851_B. Arpa and an exam about geometry	"Takahashi has a string S of length N consisting of lowercase English letters. On this string, he wi(...TRUNCATED)	{ "input": [ "5\n3 2 1 6 5\n", "4\n3 3 3 3\n" ], "output": [ "8", "0" ] }	{"input":["4\n1 2 4 3\n","4\n2 1 4 3\n","10\n1 2 10 9 7 4 8 3 6 5\n","10\n1 7 10 6 5 2 3 8 9 4\n","4(...TRUNCATED)	{"input":["2 3 3\n.#\nS.","7 8 2\n\n\n...##\n###S\n.#.##\n.###","7 7 2\n\n\n##...\nS###\n.#.##\n.###(...TRUNCATED)	5	10	{"language":[3,3,4,2,1,3,2,3,4,3,2,4,3,3,3,3,3,3,3,1,3,3,3,1,3,2,3,2,3,3,3,1,3,1,1,1,1,4,1,3,2,3,3,3(...TRUNCATED)	{"language":[4,4,4,4,3,2,2,2,1,2,2,2,2,4,4,2,2,4,2,4,4,2,2,3,2,1,3,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	E	0	1,100	[ "constructive algorithms", "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1075_D. Intersecting Subtrees	"You are given a simple code of a function and you would like to know what it will return. \n\n F(N,(...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": [], "output": [] }	{"input":["10000 01000 00100 11000 01100 11111 01110 11100 10110 11110\n10101 01000 00000 11001 0110(...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,2,2,2,2,2,3,4,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,4,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,2,2(...TRUNCATED)	0		0	3,000	[ "bitmasks", "brute force", "dp", "math" ]	false	{ "nanos": 0, "seconds": 3 }	268,435,456
p03371 AtCoder Beginner Contest 095 - Half and Half	"Snuke has decided to play a game, where the player runs a railway company. There are M+1 stations o(...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":["8587340257\n","9\n","81\n","27\n","1408514752349\n","25\n","49380563\n","266418\n","31975(...TRUNCATED)	{"input":["6 1 2 3 4 7","6 106 2 3 4 5","6 2 2 3 4 7","6 159 2 3 4 5","6 200 2 3 8 8","6 159 2 3 3 5(...TRUNCATED)	2	8	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[3,2,2,2,3,3,2,2,3,0,3,2,3,2,3,3,0,4,2,2,2,3,2,2,0,2,4,4,0,2,0,3,2,2,3,3,3,3,2,2,0,0,2,2(...TRUNCATED)	147	C	0	1,800	[ "greedy" ]	false	{ "nanos": 0, "seconds": 6 }	256,000,000
331_D2. Escaping on Beaveractor	Example Input 4 3 1 3 4 7 Output 6	{"input":["7 6 6\n3 2\n1 7\n5 7\n3 7\n6 4\n8 9\n8 5\n","5 2 2\n1 1\n4 1\n2 3\n3 2\n3 4\n"],"output":(...TRUNCATED)	{ "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)	2	8	{"language":[2,4,3,2,3,1,3,4,3,2,4,4,3,3,2,2,2,3,1,1,1,2,2,3,4,4,3,4,1,1,2,3,1,2,4,2,3,4,3,3,3,2,1,4(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	D	0	0	[ "implementation", "strings" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000