Datasets:

TheFactoryX
/

edition_1484_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
1027_E. Inverse Coloring	"A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang (...TRUNCATED)	{ "input": [ "3\n1 2\n2 3\n", "5\n1 2\n1 3\n1 4\n1 5\n" ], "output": [ "1 1 1\n", "1 0 0 0 0\n" ] }	{ "input": [], "output": [] }	{"input":["aaaa b","dcba cb","aa`a a","dcac dc","a``a a","b abab","aaaa c","dcba bc","b baba","aaa` (...TRUNCATED)	2	7	{"language":[2,3,2,2,4,2,4,3,4,4,3,2,1,3,1,2,2,4,2,4,4,2,4,4,4,4,4,1,3,3,1,2,3,1,3,2,3,2,4,4,2,3,3,3(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	0	[ "constructive algorithms", "greedy", "number theory" ]	false		{ "nanos": 0, "seconds": 2 }	64,000,000
p03725 AtCoder Grand Contest 014 - Closed Rooms	"Polycarp often uses his smartphone. He has already installed n applications on it. Application with(...TRUNCATED)	{"input":["4 4\n1 2\n3 2\n3 4\n1 3","15 28\n10 7\n5 9\n2 13\n2 14\n6 1\n5 12\n2 10\n3 9\n10 15\n11 1(...TRUNCATED)	{"input":["24\n9 83\n90 31\n83 3\n83 3\n21 31\n83 3\n32 31\n12 21\n31 21\n90 32\n32 21\n12 9\n12 31\(...TRUNCATED)	{"input":["4\n3\n1 4 2\n1 3 1\n2\n2 4\n2 3\n2\n1 1100000000\n1 1000000000\n4\n3 10 5 8\n2 5 2 4\n","(...TRUNCATED)	3	8	{"language":[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,2(...TRUNCATED)	{"language":[4,1,2,2,2,2,2,4,2,4,3,4,4,2,4,3,3,3,2,2,3,2,3,4,4,4,4,2,2,3,3,2,2,2,2,2,2,3,4,2,3,2,4,2(...TRUNCATED)	1,202	C	0	0	[ "binary search", "greedy", "ternary search" ]	false		null	256,000,000
p03225 Tenka1 Programmer Contest - Equilateral	"The bustling town of Siruseri has just one sports stadium. There\nare a number of schools, colleges(...TRUNCATED)	{ "input": [ "5 5\n1 2 3 4 5\n", "3 1\n1 1 2\n", "5 2\n1 1 2 1 3\n" ], "output": [ "16", "3", "14" ] }	{ "input": [], "output": [] }	{"input":["5\n7 46 11 17 11","7\n994 518 941 851 647 2 568","3\n3 1 6","5\n7 46 11 17 13","7\n994 51(...TRUNCATED)	2	8	{"language":[4,4,4,4,4,4,4,3,3,2,4,4,4,3,3,4,2,2,4,3,3,3,4,3,1,2,2,3,1,2,4,1,1,4,2,2,4,1,3,3,4,4,4,3(...TRUNCATED)	{"language":[4,0,0,0,2,0,0,4,2,2,0,0,2,2,0,4,4,2,0,0,2,2,2,4,2,2,0,0,2,4,2,2,4,2,0,4,4,0,0,0,0,0,0,2(...TRUNCATED)	650		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 3 }	0
p00206 Next Trip	"You are given an integer x represented as a product of n its prime divisors p_1 ⋅ p_2, ⋅ … (...TRUNCATED)	{ "input": [ "1 1 1 4 4\n", "2 0 0 0 4\n", "4 5 6 5 6\n" ], "output": [ "3\n", "1\n", "0\n" ] }	{"input":["3 3 1\n","300 2 300\n","4000 4000 1\n","4000 4000 100\n","4 2 3\n","3 300 300\n","4000 10(...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	7	{"language":[2],"solution":["//\n// Problem: Kimagagure Cleaner\n// Solution by: MORI Shingo\n// O(n(...TRUNCATED)	{"language":[2,4,0,2,2,0,2,2,2,2,2,2,2,2,2,2,2,4,2,0,2,2,2,4,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)	0	A	1,000	0	[ "geometry", "math" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
765_D. Artsem and Saunders	"The educational program (AHK Education) of the Aiz Broadcasting Corporation broadcasts a program ca(...TRUNCATED)	{ "input": [ "2\n2 1\n5 4\n3 2\n1 0 2\n\nSAMPLE" ], "output": [ "9\n1\n" ] }	{"input":["1 1\nt\n+ 2 p\n","2 12\naa\n+ 1 a\n+ 2 a\n+ 3 a\n- 1\n+ 1 a\n- 2\n+ 2 a\n- 3\n+ 3 a\n+ 2 (...TRUNCATED)	{"input":["50 5000\n2 35 46\n2 43 92\n2 16 88\n2 67 99\n2 36 93\n2 12 20\n2 33 96\n2 55 82\n2 18 32\(...TRUNCATED)	2	10	{"language":[2,2,2,4,2,2,3,3,4,3,4,3,3,2,4,4,1,3,4,4,1,3,2,4,2,2,2,4,3,3,3,2,4,2,2,3,1,2,2,4,3,4,4,3(...TRUNCATED)	{"language":[2,1,4,2,4,2,2,4,2,2,4,4,3,2,2,4,2,2,4,3,2,2,4,3,1,4,2,4,4,2,2,3,4,1,3,4,4,4,2,2,2,2,4,4(...TRUNCATED)	1,096		1,500	1,000	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
stadium	"You are given an array of n integers. For each element output the sum of itself and the previous el(...TRUNCATED)	{"input":["6\n1 1 1 0 0 0\n","5\n0 0 0 0 0\n","7\n1 0 0 1 0 0 1\n"],"output":["\n9\n","\n0\n","\n3\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10\n2 3 1 5 6 4 2 10 7 7\n5\n10 1\n5 7\n19 6\n1 1\n10 8\n","10\n2 3 1 5 6 4 1 10 7 7\n5\n(...TRUNCATED)	2	8	{"language":[4,2,3,4,2,2,4,3,4,3,2,4,4,2,1,2,2,4,2,2,2,2,4,4,3,2,4,3,2,2,2,2,4,4,2,2,4,2,2,4,2,4,4,2(...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)	754	E2	0	1,900	[ "dp", "matrices", "sortings" ]	false	"アイヅ放送協会の教育番組(ＡＨＫ教育)では、子供向けの工作番組「あそ(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000
vowel	"Let's consider the following game. We have a rectangular field n × m in size. Some squares of the (...TRUNCATED)	{"input":["3 3\n1 2\n2 3\n3 3","7 9\n1 7\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4"],"output":["3\n2\n2","7\n6\n(...TRUNCATED)	{"input":["42 28\n7 19\n15 24\n3 42\n18 5\n32 27\n26 20\n40 30\n35 2\n14 8\n22 10\n36 4\n16 14\n21 2(...TRUNCATED)	{"input":["1\n2\n111 2\n115 112\n","10\n5\n88 60\n10 3\n48 21\n90 70\n40 88\n5\n20 81\n39 98\n34 87\(...TRUNCATED)	5	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,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,512		0	900	[]	false		null	256,000,000
1144_B. Parity Alternated Deletions	"You can't possibly imagine how cold our friends are this winter in Nvodsk! Two of them play the fol(...TRUNCATED)	{"input":["4 4\n1 2 1 10\n2 4 3 5\n1 3 1 5\n2 4 2 7\n","5 6\n1 2 1 10\n2 5 11 20\n1 4 2 5\n1 3 10 11(...TRUNCATED)	{"input":["3\n2 2 3\n","5\n1 4 5 4 5\n","4\n2 2 4 4\n","3\n1 1 2\n","4\n1 2 1 2\n","4\n4 2 2 4\n","6(...TRUNCATED)	{ "input": [], "output": [] }	2	0	{"language":[1,1,1,1],"solution":["n,q=map(int,raw_input().split())\nb=map(int,raw_input().split())\(...TRUNCATED)	{"language":[4,2,4,3,2,2,3,4,2,4,3,3,3,4,2,2,4,3,4,2,2,2,3,4,2,2,2,2,4,3,4,2,2,4,2,2,4,3,2,3,4,2,2,2(...TRUNCATED)	609		500	2,400	[ "" ]	false	"標準録画で 120 分のビデオテープがあります。テープを完全に巻き戻した(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	268,435,456
626_D. Jerry's Protest	"You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is paint(...TRUNCATED)	{ "input": [ "2\n2\n2 2\n1\n6" ], "output": [ "4\n2\n" ] }	{"input":["5\n27468 7465 74275 40573 40155\n112071 76270 244461 264202 132397\n1 777133331\n2 107454(...TRUNCATED)	{"input":["2008 2 29\n2015 1 1","1505 9 9\n2001 11 3","1505 9 9\n2619 11 3","1505 13 9\n2619 11 3","(...TRUNCATED)	2	11	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,4,4,4,2,2,2,2,2,2,1,2,2,2,2,2,1,2,4,2,4,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,4,2,2,2,2,2,2,4,2,2,4,4,2,2,4,2,4,2,4,2,2,2,2,4,4,4,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,4,2(...TRUNCATED)	219		1,750	2,200	[ "binary search", "data structures", "math" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
691_D. Swaps in Permutation	"Two players play the following game. Initially, the players have a knife and a rectangular sheet of(...TRUNCATED)	{ "input": [ "3\noxx" ], "output": [ "2" ] }	{ "input": [], "output": [] }	{"input":["4\nlu ru ld rd\n4\nlu ld lu ru\n0\nlu\n10\nru lu ld rd ru rd ru lu rd ld\n0","4\nlu ru ld(...TRUNCATED)	2	14	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nu(...TRUNCATED)	{"language":[3,3,2,2,2,3,2,3,4,3,3,2,4,4,2,2,4,4,4,3,4,3,3,2,1,4,4,1,1,3,4,2,3,4,3,2,2,1,3,3,3,2,4,2(...TRUNCATED)	1,374		0	1,600	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000