Datasets:

TheFactoryX
/

edition_0719_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
70_C. Lucky Tickets	Example Input 2 1 1 2 2 Output 1	{"input":["10\n1 10 2 9 3 8 4 7 5 6\n","4\n1 2 3 4\n","3\n1 2 3\n"],"output":["4.500000000000024\n",(...TRUNCATED)	{"input":["15\nMIRZOYANOVECLOX\n","23\nAABBBAAACCCCCAAADDDDDDD\n","2\nQA\n","11\nGGRRAATTZZZ\n","6\n(...TRUNCATED)	{"input":["3,4,5\n5,5,8\n4,5,4\n5,4,3","3,3,5\n5,5,8\n4,4,4\n5,4,3","3,4,5\n5,5,8\n4,5,4\n3,4,5","3,(...TRUNCATED)	2	6	{"language":[1,1],"solution":["#!/usr/bin/env python\n#-- coding:utf-8 --\n\n\ndef convert_pair(a,(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,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,4(...TRUNCATED)	1,117	B	0	2,500	[ "combinatorics", "math", "number theory" ]	false	"E - Disappear Drive / 消えるドライヴ\n\nStory\n\nDのひとはバスケットボールが好(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
152_E. Garden	"Recenlty Luba got a credit card and started to use it. Let's consider n consecutive days Luba uses (...TRUNCATED)	{"input":["5 3 2\nSba\nccc\naac\nccc\nabT\n","3 4 1\nSxyy\nyxxx\nyyyT\n","1 3 3\nTyS\n","1 4 1\nSxyT(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["48 1976\n30 97 84\n80 81 84\n41 70 45\n23 57 80\n17 60 85\n36 48 81\n51 87 81\n38 85 81\n(...TRUNCATED)	2	6	{"language":[2,4,4,4,4,4,4,4,4,4,4,4,2,2,4,4,4,4,2,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,2,4,4,4,4(...TRUNCATED)	{"language":[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,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,060	B	2,000	0	[]	false		null	0
1344_A. Hilbert's Hotel	"Ringo Mart, a convenience store, sells apple juice.\n\nOn the opening day of Ringo Mart, there were(...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":["2\n1\n3\n\n\nSAMPLE","2\n2\n3\n\n\nSBMPLE","2\n2\n2\n\n\nELPMBS","2\n4\n2\n\n\nELPMBS","2(...TRUNCATED)	3	9	{"language":[2,4,3,4,3,3,4,3,4,4,4,2,2,4,2,1,3,2,3,3,4,1,4,2,4,4,4,2,4,3,4,3,4,3,2,4,3,3,3,4,3,4,2,3(...TRUNCATED)	{"language":[3,3,4,3,2,3,1,4,4,3,2,4,3,4,2,2,2,2,2,3,4,4,4,2,4,4,2,3,3,2,2,3,4,3,3,3,2,4,3,2,3,3,1,2(...TRUNCATED)	354		0	0	[ "bitmasks", "dp", "graphs", "trees" ]	false	"うさぎがある電車のチケットをn 枚持っている. チケットにはそれぞれ0 か(...TRUNCATED)	{ "nanos": 0, "seconds": 8 }	256,000,000
p00163 Highway Toll	"You are given an undirected graph, consisting of n vertices and m edges. The graph does not necessa(...TRUNCATED)	{ "input": [ "4\n2 10\n0 20\n1 5\n1 3\n", "3\n0 1\n0 10\n0 100\n" ], "output": [ "8", "111" ] }	{ "input": [], "output": [] }	{"input":["0?0?","00??","??00????0??1????0?0??00??1???11?1?1???1?11?111???1","1???11??11?1???1?1?11?(...TRUNCATED)	2	12	{"language":[2,4,4,3,4,1,2,3,4,3,4,2,2,4,1,3,4,4,2,2,2,3,2,2,3,1,3,3,4,4,3,4,3,2,4,4,1,2,2,2,2,2,2,3(...TRUNCATED)	{"language":[2,2,2,0,2,4,2,2,2,2,4,2,3,2,0,2,2,2,2,2,2,2,0,2,4,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2(...TRUNCATED)	0		0	1,800	[ "greedy" ]	false		{ "nanos": 0, "seconds": 2 }	0
168_A. Wizards and Demonstration	"Strings can be efficiently stored as a data structure, to have efficient searching methods.\nA new (...TRUNCATED)	{ "input": [ "aabb\n", "aabcaa\n" ], "output": [ "2\n", "1\n" ] }	{ "input": [], "output": [] }	{"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	6	{"language":[4,3,4,4,3,3,3,3,3,3,3,4,4,3,3,3,4,3,3,3,3,2,2,3,2,3,3,4,3,2,3,4,2,4,3,4,3,3,3,3,3,4,3,3(...TRUNCATED)	{"language":[2,3,4,3,3,4,2,2,3,3,2,2,2,3,3,3,2,2,3,3,3,4,2,3,2,2,3,2,3,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2(...TRUNCATED)	494	A	500	0	[ "" ]	true		{ "nanos": 0, "seconds": 3 }	256,000,000
650_B. Image Preview	"An established group of scientists are working on finding solution to NP hard problems. They claim (...TRUNCATED)	{ "input": [ "3 4\n2 1 4\n3 1 3 1\n1 2\n", "3 3\n1 1\n1 2\n1 1\n" ], "output": [ "YES\n", "NO\n" ] }	{ "input": [], "output": [] }	{"input":["46\n63 1\n63 63\n123 1\n123 123\n63 2\n63 62\n123 2\n123 122\n63 3\n63 61\n123 3\n123 121(...TRUNCATED)	2	0	{"language":[2,3,3,2,3,1,3,2,4,2,4,3,3,2,3,4,2,3,3,3,3,3,2,3,3,3,3,2,3,3,4,4,4,3,3,3,1,3,3,2,3,4,3,3(...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)	1,547		0	2,400	[ "data structures" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
938_B. Run For Your Prize	"Bearland is a dangerous place. Limak can’t travel on foot. Instead, he has k magic teleportation (...TRUNCATED)	{"input":["5\n0.50 0.29 0.49 0.95 0.83\n2 3\n0 3\n3 4\n2 1\n3\n4 0.66\n1 0.69\n0 0.36\n"],"output":[(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["7 9\n1 9\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4","7 9\n1 9\n9 9\n5 7\n5 9\n1 1\n6 8\n3 4","7 11\n1(...TRUNCATED)	2	0	{"language":[2,2,3,2,4,4,2,2,1,4,2,2,4,2,4,4,3,3,3,3,4,3,1,4,4,1,3,2,4,4,4,3,3,2,3,2,3,2,3,3,3,3,4,4(...TRUNCATED)	{"language":[2,2,2,4,4,4,2,4,2,2,1,4,4,2,1,2,2,4,4,2,2,2,4,4,2,2,2,3,4,2,2,2,4,2,2,4,3,2,2,2,4,2,3,2(...TRUNCATED)	0		0	3,000	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
p03612 AtCoder Beginner Contest 072 - Derangement	"You are given an array a_1, a_2, ... , a_n, which is sorted in non-decreasing order (a_i ≤ a_{i +(...TRUNCATED)	{ "input": [ "5 4\n2 4 8 2 4\n8\n5\n14\n10\n" ], "output": [ "1\n-1\n3\n2\n" ] }	{ "input": [], "output": [] }	{"input":["1\n3\nS10\n111\n00F\n","1\n5\nS0000\n10000\n00000\n00000\n0000F\n","1\n3\nS10\n110\n11F\n(...TRUNCATED)	2	7	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	C	0	1,900	[ "" ]	false		null	134,217,728
1088_D. Ehab and another another xor problem	Example Input 4 3 1 3 4 7 Output 6	{"input":["5 5 13 0 4\n0 1 5\n2 1 2\n3 2 3\n1 4 0\n4 3 4\n","2 1 123456789 0 1\n0 1 0\n","2 1 999999(...TRUNCATED)	{"input":["21\n11 19 4 19 6 0 13 7 6 2 5 3 16 10 1 9 15 21 9 21 2\n","100\n57 85 27 81 41 27 73 10 7(...TRUNCATED)	{"input":["1\n17\n","3\n10 7 14\n","3\n10 7 16\n","1\n7\n","1\n24\n","1\n9\n","1\n2\n","1\n10\n","3\(...TRUNCATED)	2	10	{"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],"solution":["b=\"AEIOUaeiou\"\nt(...TRUNCATED)	{"language":[2,2,4,4,4,4,2,3,3,3,3,3,3,3,3,2,3,2,4,3,1,4,2,2,2,3,2,4,4,2,3,3,4,2,2,3,1,3,2,4,4,4,3,2(...TRUNCATED)	0		1,500	0	[ "geometry", "math" ]	true		{ "nanos": 0, "seconds": 3 }	536,870,912
1490_D. Permutation Transformation	"There was a large mansion surrounded by high walls. The owner of the mansion loved cats so much tha(...TRUNCATED)	{ "input": [ "2\n4 1\n2 15 36 43 \n3 2\n27 30 35 \n\nSAMPLE" ], "output": [ "41\n5\n" ] }	{"input":["100 1 7\n83\n174\n191\n145\n167\n55\n232\n157\n51\n209\n85\n73\n216\n39\n72\n76\n132\n70\(...TRUNCATED)	{"input":["2\n1 10\n2\n2 2\n2 1\n1 1\n","2\n3922 3922\n1\n2 2\n2 1\n1 1\n","1\n1\n2\n1 1\n1 1\n1 1\n(...TRUNCATED)	2	11	{"language":[2,2,2,2,2,2,2,2,4,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,3,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,2,2,2,0,2,2,0,0,2,2,2,4,2,2,0,2,4,3,2,2,2,4,2,2,3,2,2,0,0,2,2,2,2,2,0,2,2(...TRUNCATED)	0		500	0	[ "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000