Datasets:

TheFactoryX
/

edition_1042_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
650_B. Image Preview	"You are given an undirected graph consisting of n vertices and <image> edges. Instead of giving you(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	{"input":["51\n1732111733638718702525811518175029394157760329139501\n","55\n815096522892298714932212(...TRUNCATED)	2	7	{"language":[2,4,4,2,2,2,2,4,2,4,2,4,2,2,2,4,4,2,4,4,2,2,2,2,2,2,2,2,2,4,2,4,2,4,4,2,2,2,2,4,2,2,2,4(...TRUNCATED)	{"language":[2,1,4,4,2,2,3,2,4,2,2,2,4,2,2,4,4,2,4,2,2,2,2,3,2,2,2,2,2,2,2,4,3,4,2,1,2,2,4,2,2,4,4,2(...TRUNCATED)	0		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1428_D. Bouncing Boomerangs	"Some country is populated by wizards. They want to organize a demonstration.\n\nThere are n people (...TRUNCATED)	{"input":["2 2\n6 3\nMonday Tuesday Wednesday\n8 4\nThursday Friday Saturday Sunday\n2 2\n7 3\nMonda(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	10	{"language":[3,4,3,4,3,2,2,3,3,3,4,3,3,2,3,2,1,2,3,3,2,3,3,2,4,4,4,2,3,3,3,3,3,4,3,3,2,3,3,3,2,3,3,4(...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)	716	A	0	1,500	[ "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	1,073,741,824
palin-pairs	"There are N people standing on the x-axis. Let the coordinate of Person i be x_i. For every i, x_i (...TRUNCATED)	{ "input": [ "3\n0 0 0\n", "5\n0 1 1 1 10\n", "2\n0 1\n" ], "output": [ "3 2 1 ", "1 4 3 2 5 ", "1 2 " ] }	{"input":["1 1 1 2\n5\n1000000000 1 10000\n19920401 1188 5566\n1000000000 1 10000\n1 1 10000\n5 100 (...TRUNCATED)	{"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)	2	0	{"language":[2,4,2,2,2,2,2,4,4,2,2,4,2,2,2,3,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,4,2,2,4,2,4,2,4,2,2,2,1,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,4,4,2,4,2,2,2,2,2,2(...TRUNCATED)	0		3,000	0	[ "constructive algorithms" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
909_D. Colorful Points	"A substring of some string is called the most frequent, if the number of its occurrences is not les(...TRUNCATED)	{ "input": [ "4\n47\n74\n477\n4747477" ], "output": [ "2\n2\n3\n23\n" ] }	{ "input": [], "output": [] }	{"input":["1 100000 100000 110000 -100000\n","46456 -250 -23623 -98302 -99305\n","10 6 3 7 2\n","1 -(...TRUNCATED)	2	1	{"language":[1,1,1,1,1,1,1,1,1,1,1,1],"solution":["import math\nimport sys\ndef checkpal(s):\n re(...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)	248	E	2,500	3,100	[ "geometry", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
ig01	"The HR manager was disappointed again. The last applicant failed the interview the same way as 24 p(...TRUNCATED)	{"input":["1 2\n3 4\n5 6\n","11 10\n13 8\n5 16\n","3 7\n4 6\n5 5\n","10 10\n10 10\n10 10\n"],"output(...TRUNCATED)	{"input":["10 16\n9 8\n1 2\n9 5\n5 4\n9 2\n3 2\n1 6\n5 10\n7 2\n8 2\n3 7\n4 9\n5 7\n10 3\n10 9\n7 8\(...TRUNCATED)	{"input":["100 10000\n337491026 878382762 942177429 998998997 292784016 407647544 813626083 20338593(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include<iostream>\n#include<algo(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,2,1,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,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	0		0	2,100	[ "*special", "binary search", "constructive algorithms", "interactive" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
19_B. Checkout Assistant	"Two little greedy bears have found two pieces of cheese in the forest of weight a and b grams, corr(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10\n-405 -230 252 -393 -390 -259 97 163 81 -129\n","3\n10000 -10000 10000\n","1\n-10000\n(...TRUNCATED)	{"input":["10\n-405 -230 252 -393 -271 -259 97 163 81 -129\n","10\n1 10 2 9 6 8 4 7 5 6\n","4\n1 2 5(...TRUNCATED)	1	7	{"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		0	2,900	[ "constructive algorithms", "graphs", "greedy", "sortings" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
1227_D1. Optimal Subsequences (Easy Version)	"You are given a simple arithmetic expression of the form a?b, where a and b are integer constants, (...TRUNCATED)	{"input":["11 7 5\n24979445 861648772 623690081 433933447 476190629 262703497 211047202 971407775 62(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	6	11	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	958		0	2,000	[ "dp", "greedy", "sortings" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
p02679 AtCoder Beginner Contest 168 - ∙ (Bullet)	"A certain business maintains a list of all its customers' names. The list is arranged in order of i(...TRUNCATED)	{ "input": [ "3\n1 2 3\n", "5\n5 4 3 2 1\n" ], "output": [ "0 0 0\n", "0 1 3 6 10\n" ] }	{"input":["997 6 680633279\n","989 8 990767311\n","999 2 750160753\n","1 4 904448911\n","1000 3 7501(...TRUNCATED)	{"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	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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	174	H	1,000	0	[ "implementation" ]	false		{ "nanos": 0, "seconds": 8 }	134,217,728
p02916 AtCoder Beginner Contest 140 - Buffet	"You are given a matrix consisting of n rows and m columns. The matrix contains lowercase letters of(...TRUNCATED)	{"input":["1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2","3\n1 1 1 1 1 1 0 0 1 1\n0 1 0 1 1 1 1 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n1\n2 3\n2\n4 5\n5 6\n2\n2 3\n1 5","3\n1\n2 3\n2\n4 5\n5 6\n1\n2 3\n3 5","3\n1\n1 3\n2\(...TRUNCATED)	2	0	{"language":[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,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,420	C	0	0	[]	false	"太郎君はかけざんを習いたての小学生です。なんとなく、彼はかけざんを(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000
323_C. Two permutations	"Print the K-th element of the following sequence of length 32:\n\n\n1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1(...TRUNCATED)	{"input":["17\ntypedef void* b\ntypedef b* c\ntypeof b\ntypeof c\ntypedef &b b\ntypeof b\ntypeof(...TRUNCATED)	{"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":["9 3\n","56 1000\n","1000 1100\n","5 10\n","1100 500\n","3 1001\n","900 1\n","1 3\n","3 16(...TRUNCATED)	5	10	{"language":[3,2,4,3,2,4,2,3,4,3,3,4,2,2,3,3,2,2,3,2,3,2,3,4,2,2,2,2,2,2,3,3,2,2,2,2,2,3,2,3,2,2,2,2(...TRUNCATED)	{"language":[2,2],"solution":["#include <bits/stdc++.h>\n \n#define _overload(_1,_2,_3,name,...) nam(...TRUNCATED)	0		0	1,800	[ "data structures", "dp", "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000