Datasets:

TheFactoryX
/

edition_2624_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
1334_A. Level Statistics	"You are playing a computer card game called Splay the Sire. Currently you are struggling to defeat (...TRUNCATED)	{ "input": [ "4\n", "583291\n" ], "output": [ "16\n", "135712853\n" ] }	{"input":["4\n10 4\n15 1\n19 3\n20 1\n","2\n1 999999999\n1000000000 1000000000\n","67\n1 1\n3 8\n4 1(...TRUNCATED)	{"input":["1\n0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0\n7\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n1 0 0 0 0 0 1 0 0(...TRUNCATED)	2	0	{"language":[1],"solution":["T=input()\nbest=-1\nbound=10**12\nboundS=str(bound)\ndef findBest(s,off(...TRUNCATED)	{"language":[3,4,2,4,2,3,3,3,3,2,2,3,3,3,3,3,3,3,3,2,2,3,3,3,3,3,1,3,1,1,2,2,3,2,3,1,2,2,4,3,3,3,3,3(...TRUNCATED)	0		0	0	[ "brute force", "constructive algorithms", "greedy", "math" ]	false	{ "nanos": 0, "seconds": 4 }	256,000,000
1428_D. Bouncing Boomerangs	"Problem description.\nVipul is a hardworking super-hero who maintains the bracket ratio of all the (...TRUNCATED)	{ "input": [ "1\n100000 2", "3\n2 1\n1 3\n2 2" ], "output": [ "100002 0", "3 0\n5 0" ] }	{ "input": [], "output": [] }	{"input":["3\n3 2 0\n","3\n1 2 0\n","3\n2 0 2\n","11\n1 1 1 1 1 2 4 2 2 2 1\n","5\n1 1 2 1 2\n","5\n(...TRUNCATED)	2	10	{"language":[2,2,2,2,2,2],"solution":["#include <stdio.h>\n#include <stdlib.h>\n#include <assert.h>\(...TRUNCATED)	{"language":[2,2,0,2,2,3,2,2,2,2,3,2,2,2,2,2,3,2,2,2,3,2,2,3,2,0,2,3,2,3,2,2,3,2,3,0,0,2,2,2,2,3,2,4(...TRUNCATED)	0	D	0	0	[ "trees" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p01484 Icy Composer	"Geometric progression with the first element a and common ratio b is a sequence of numbers a, ab, a(...TRUNCATED)	{ "input": [ "2\n2 1\n5 4\n3 2\n1 0 2\n\nSAMPLE" ], "output": [ "9\n1\n" ] }	{"input":["3\n7\n4 6 11 11 15 18 20\n4\n10 10 10 11\n3\n1 1 1000000000\n","1\n6\n1 1 1 2 2 3\n","1\n(...TRUNCATED)	{"input":["11\nadd 1\nsum\nadd 2\nsum\nadd 3\nsum\nadd 4\nsum\nadd 6\nsum\nadd 6\n","6\nadd 4\nadd 7(...TRUNCATED)	2	9	{"language":[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,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,2,2,4,4,1,2,4,2,2,4,2,2,4,3,2,3,2,4,2,2,4,2,3,4,1,2,2,4,4,2,2,2,2,4,2,4,2,2,2,2,4,4(...TRUNCATED)	339	C1	0	0	[]	true	{ "nanos": 0, "seconds": 3 }	256,000,000
38_C. Blinds	"Gildong was hiking a mountain, walking by millions of trees. Inspired by them, he suddenly came up (...TRUNCATED)	{ "input": [ "2\n3\n10" ], "output": [ "1\n3" ] }	{"input":["1 1\n0\n10000\n","2 3\n1 0\n4 7\n","1 2\n0\n10000\n","3 10\n0 1 2\n9240 5331 6721\n","4 1(...TRUNCATED)	{"input":["2\n2\nbhopal\ndelhi\n3\nbhopal\neelhi\ndehradun\n\nSAMPLE","100\n4\nlrbbmqb\ncd\nr\nowkk\(...TRUNCATED)	5	0	{ "language": [], "solution": [] }	{ "language": [], "solution": [] }	219	C	0	0	[ "two pointers" ]	false	{ "nanos": 0, "seconds": 6 }	256,000,000
1184_B3. The Doctor Meets Vader (Hard)	"You have a Petri dish with bacteria and you are preparing to dive into the harsh micro-world. But, (...TRUNCATED)	{"input":["10 9 3 1\n10 9 11\n9 2 37\n2 4 4\n4 1 8\n1 5 2\n5 7 3\n7 3 2\n3 8 4\n8 6 13\n2 3\n","9 11(...TRUNCATED)	{"input":["15\n0 1\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 0\n(...TRUNCATED)	{"input":["3\nnxx","3\nnwx","3\nxxo","3\nxwn","3\nowx","3\npxx","3\npyx","3\npzx","3\npzw","3\npwz",(...TRUNCATED)	1	0	{"language":[3,3,4,3,2,2,3,4,3,3,3,3,3,2,2,3,2,4,3,3,4,3,3,3,2,3,3,2,3,3,4,4,3,3,3,4,3,4,2,4,3,3,3,3(...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	D	2,000	0	[ "math" ]	false	null	512,000,000
592_E. BCPC	"Background\n\nThe kindergarten attached to the University of Aizu is a kindergarten where children (...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": [], "output": [] }	{"input":["5\n0 968804136\n0 736567537\n2 343136264\n0 259899572\n1 103950505\n","5\n0 51690939\n0 6(...TRUNCATED)	2	15	{"language":[2,4,2,2,4,2,2,2,2,4,2,2,2,2,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,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,1,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2(...TRUNCATED)	0	E	1,000	0	[ "dp", "implementation", "math", "number theory" ]	false	{ "nanos": 0, "seconds": 1 }	1,073,741,824
1149_E. Election Promises	"As technologies develop, manufacturers are making the process of unlocking a phone as user-friendly(...TRUNCATED)	{ "input": [ "2\n5\n5", "3\n1\n4\n3" ], "output": [ "5\n5", "4\n3\n4" ] }	{"input":["10 1\n1 1 1 1 1 1 1 1 1 1\n","3 57\n78 165 54\n","1 1\n10000\n","2 2\n2 2\n","9 13\n132 8(...TRUNCATED)	{"input":["36 102 73 101 19\n5 9 2 4 6\n4 13\n","0 0 119 0 1\n0 0 2 0 0\n5 5\n","0 0 0 0 0\n10 10 10(...TRUNCATED)	3	10	{"language":[4,4,3,2,4,2,1,3,2,3,1,4,4,3,1,2,1,4,2,3,2,4,4,2,4,3,3,1,4,2,2,2,3,1,3,2,4,3,4,4,4,1,1,2(...TRUNCATED)	{"language":[2,2,2,2,2,4,4,4,4,3,2,3,4,3,4,3,4,3,2,4,2,2,4,3,3,4,3,2,2,2,1,4,3,4,2,3,4,3,1,4,3,3,4,2(...TRUNCATED)	0		1,500	900	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
1257_G. Divisor Set	"Two players play the following game. Initially, the players have a knife and a rectangular sheet of(...TRUNCATED)	{ "input": [ "0.0,0.0,1.0,0.0,1.0,1.0,0.0,1.0\n0.0,0.0,3.0,0.0,1.0,1.0,1.0,3.0" ], "output": [ "YES\nNO" ] }	{ "input": [], "output": [] }	{"input":["2\n5\n6 5 4 3 2\n5\n3 4 6 1 1","2\n5\n6 5 4 3 2\n5\n3 7 9 1 1","2\n5\n6 5 4 3 3\n5\n3 7 9(...TRUNCATED)	2	11	{"language":[1,1],"solution":["'''\n# Read input from stdin and provide input before running code\n\(...TRUNCATED)	{"language":[4,4,2,2,2,4,2,2,2,2,2,2,2,4,4,4,4,2,2,4,3,2,4,4,2,1,4,2,4,4,2,3,3,4,2,2,2,2,4,2,2,4,2,2(...TRUNCATED)	0	D	0	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
996_F. Game	"Diverta City is a new city consisting of N towns numbered 1, 2, ..., N.\n\nThe mayor Ringo is plann(...TRUNCATED)	{"input":["4\n..E.\n.AD.\nB...\n..C.\nD\n4\n..E.\n.AD.\nB...\n..C.\nDR\n3\n...\n.A.\nBC.\n((URD)3L)2(...TRUNCATED)	{"input":["20 101 100\n1 14 20 3 19 10 12 18 4 17 13 6 8 5 2 15 7 16 9 11\n69 53 101 100 41 38 63 84(...TRUNCATED)	{"input":["aabbaaaa\nbaaaaaab\n","cba\ncba\n","xnahfslefuigq\naaaaaaaaaaaaa\n","abcddd\ndddcab\n","a(...TRUNCATED)	6	9	{"language":[3,2,3,3,4,2,3,3,3,3,3,3,3,4,2,3,2,2,3,3,3,3,3,3,2,3,3,3,1,2,3,4,3,3,2,3,2,4,2,4,4,3,3,4(...TRUNCATED)	{"language":[2,2,2,3,3,4,2,3,3,3,2,3,3,2,3,3,0,2,3,2,2,2,0,2,3,2,0,2,2,0,2,2,2,3,3,2,3,2,2,2,3,3,0,2(...TRUNCATED)	1,513	C	0	0	[ "math", "probabilities", "trees" ]	false	{ "nanos": 0, "seconds": 2 }	0
substrings-count-3	"Grigory has n magic stones, conveniently numbered from 1 to n. The charge of the i-th stone is equa(...TRUNCATED)	{"input":["3 3 5\n4 4 0\n1 3\n3 2\n3 1\n","4 5 4\n2 1 0 3\n4 3\n3 2\n1 2\n1 4\n1 3\n"],"output":["1\(...TRUNCATED)	{ "input": [ "abcdabcdab\n5\n2 2 8 ab\n2 1 10 ab\n1 3 a\n1 4 b\n2 1 4 ab\n" ], "output": [ "1\n3\n2\n" ] }	{"input":["8\n0 1\n1 0\n0 1\n1 1\n0 0\n1 0\n0 1\n1 0\n","3\n0 1\n1 1\n1 0\n","8\n0 1\n1 1\n0 1\n1 1\(...TRUNCATED)	2	9	{"language":[4,2,2,2,2,2,3,2,2,2,2,2,2,2,2,3,2,2,2,3,2,2,3,2,2,2,2,2,2,2,2,2,4,2,2,4,2,3,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,3,4,3,0,2,2,4,2,0,3,0,3,0,3,3,2,0,2,2,2,2,2,0,0,3,2,2,2,2,2,2,3,2,3,2,4,2,2,3,0,2,2,3(...TRUNCATED)	536	E	0	1,800	[ "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	134,217,728