Datasets:

TheFactoryX
/

edition_0522_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	time_limit dict	memory_limit_bytes int64 0 1.07B
425_D. Sereja and Squares	"Chef had a hard time arguing with his friend, and after getting a great old kick Chef saw a colored(...TRUNCATED)	{"input":["4","3"],"output":["0 111 157 193\n111 0 224 239\n157 224 0 258\n193 239 258 0","0 6 15\n6(...TRUNCATED)	{"input":["30\n16 3\n-334 -500 -169 -724 -478 -358 -962 -464 -705 -145 -281 -827 -961 -491 -995 -942(...TRUNCATED)	{"input":["993 992 471\n","960 935 1422\n","105 8 99\n","60 1 1\n","759 10 123\n","31 19 9\n","1705 (...TRUNCATED)	6	0	{"language":[4,1,4,3,3,3,3,4,3,2,3,2,3,3,3,3,4,3,2,3,3,2,2,2,2,2,3,4,3,4,2,1,4,3,2,2,2,3,2,4,3,2,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],"solution":["#include <bits/stdc++.h(...TRUNCATED)	903	C	500	1,300	[ "greedy", "sortings" ]	true	{ "nanos": 0, "seconds": 2 }	256,000,000
1065_F. Up and Down the Tree	"Nick has n bottles of soda left after his birthday. Each bottle is described by two values: remaini(...TRUNCATED)	{ "input": [ "73", "1" ], "output": [ "458.67252742410977361942", "6.28318530717958623200" ] }	{"input":["8\n2 3 5 7 11 13 17 19\n4 8 7 1 5 2 6 3\n","1\n2\n2\n","1\n1000000000\n100000\n","1\n1\n1(...TRUNCATED)	{"input":["5\n4\n1 2 3 4\n5 10 15 20\n4\n1 2 1 2\n5 10 15 20\n4\n2 2 4 1\n2 8 19 2\n2\n1 1\n6 9\n1\n(...TRUNCATED)	6	10	{"language":[1],"solution":["T = int(raw_input())\nfor ti in xrange(T):\n\ta,b,c = map(int,raw_input(...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,211	C	0	1,000	[ "brute force", "math" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
630_A. Again Twenty Five!	"You are given an array of n positive integers a_1, a_2, ..., a_n. You can perform the following ope(...TRUNCATED)	{ "input": [ "AprilFool\n14\n" ], "output": [ "AprILFooL" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	3	0	{"language":[4,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,4,1(...TRUNCATED)	{"language":[3,2,4,4,2,2,2,4,1,4,4,2,2,4,2,2,4,4,4,2,2,2,2,2,1,2,4,4,2,2,2,2,2,2,2,3,2,2,2,3,2,2,2,2(...TRUNCATED)	433	C	0	0	[ "binary search", "brute force", "math" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
1413_F. Roads and Ramen	"G: Destiny Draw-\n\nproblem\n\nMr. D will play a card game. This card game uses a pile of N cards. (...TRUNCATED)	{"input":["6 8\nabdabc\n+ 1 a\n+ 1 d\n+ 2 b\n+ 2 c\n+ 3 a\n+ 3 b\n+ 1 c\n- 2\n","6 8\nabbaab\n+ 1 a\(...TRUNCATED)	{"input":["1 1 1 2\n5\n1000000000 1 10000\n19920401 1188 5566\n1000000000 1 10000\n1 1 10000\n5 100 (...TRUNCATED)	{"input":["10 1\n1 0 1 1 1 1 1 1 1 1\n","3 87\n78 165 54\n","9 13\n132 166 200 62 168 51 185 192 118(...TRUNCATED)	6	0	{"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,1,1,1],"solution":["# @author Kil(...TRUNCATED)	{"language":[2,2,2,2,2,4,4,4,3,2,2,3,2,4,4,2,3,4,4,2,4,4,2,2,2,2,2,4,2,2,4,4,4,2,4,2,2,4,4,2,2,2,2,2(...TRUNCATED)	1,475		750	1,500	[ "dfs and similar", "dp", "games", "graphs" ]	false	{ "nanos": 0, "seconds": 3 }	512,000,000
p00781 Lattice Practices	"Problem description.\n The problem statement is simple , you are given an array and you have to p(...TRUNCATED)	{ "input": [ "2 2\n2 3\n2 3\n2 3\n2 2\n3 2", "2 2\n2 3\n2 3\n2 3\n2 2\n2 2" ], "output": [ "yes", "no" ] }	{"input":["21 6\n12 15 14 4 4 7 2 4 11 1 15 4 12 11 12 8 11 12 3 4 4\n","50 25\n19 1 17 6 4 21 9 16 (...TRUNCATED)	{"input":["30 1\n19 20 10 21 9 1 20 21 30 12 25 25 2 1 10 3 19 12 18 12 30 18 22 1 18 18 30 30 12\n"(...TRUNCATED)	1	0	{"language":[2,2,2,2,2,2,4,2,2,4,4,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,4,4,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,101		2,000	0	[ "geometry" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p01422 Beautiful Currency	"You are given a complete directed graph K_n with n vertices: each pair of vertices u ≠ v in K_n h(...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": [], "output": [] }	{"input":["3\n1 3 2\n-100 2 6\n","2\n2 1\n-4 0\n","2\n0 1\n-4 0\n","2\n0 2\n-4 0\n","3\n1 5 2\n-167 (...TRUNCATED)	6	8	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["from sys import stdin\nt = stdin.readli(...TRUNCATED)	{"language":[2,2,2,3,2,4,2,2,3,1,3,2,2,2,2,3,4,2,2,2,2,2,3,2,2,4,2,3,2,3,3,4,2,2,2,3,2,3,2,3,2,2,2,3(...TRUNCATED)	20	G	500	2,400	[ "graphs" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
etmx05	"Jzzhu have n non-negative integers a1, a2, ..., an. We will call a sequence of indexes i1, i2, ...,(...TRUNCATED)	{"input":["3 3\n0 0 0 1\n0 2 2 2\n3 3 2 3\n12\n0 0 L 0\n0 0 L 1\n0 0 L 2\n0 0 L 3\n0 0 L 4\n0 0 L 5\(...TRUNCATED)	{"input":["1\n5\n1 3 4 5 2\n","1\n3\n1 1 274005660\n","4\n7\n6 6 8 8 6 6 6\n1\n2\n5\n4 5 9 8 7\n7\n1(...TRUNCATED)	{"input":["10 2 6\n1 2\n1 4\n2 1 8\n2 9 2\n1 2\n1 9\n2 3 5\n1 8\n","10 5 2\n1 2\n1 3\n2 4\n2 5\n1 6\(...TRUNCATED)	2	0	{"language":[2],"solution":["//\n// Problem: Kimagagure Cleaner\n// Solution by: MORI Shingo\n// O(n(...TRUNCATED)	{"language":[2,2,2,4,2,2,2,2,4,2,2,2,4,2,2,4,4,4,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,4,2,2,1,2,2,3,4,2(...TRUNCATED)	0	E	0	2,200	[ "dp", "greedy", "strings" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
556_C. Case of Matryoshkas	"Mad scientist Mike has just finished constructing a new device to search for extraterrestrial intel(...TRUNCATED)	{ "input": [ "-++-\n", "++\n", "+-\n", "-\n" ], "output": [ "YES\n", "YES\n", "NO\n", "NO\n" ] }	{ "input": [], "output": [] }	{"input":["4 50\n0 10000\n1 10000\n2 1\n10000 0","4 10001\n0 0\n1 1\n9999 0\n10000 10000","4 100\n0 (...TRUNCATED)	2	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,0,0,0,3,2,2,0,4,0,1,2,0,3,1,0,2,0,2,2,2,4,2,0,0,0,4,2,0,2,0,2,0,2,4,3,0,3,2,3,4,0,0(...TRUNCATED)	5	C	0	0	[ "graphs", "greedy", "shortest paths" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
chefrp	"You are given an array A of size N, and Q queries to deal with. For each query, you are given an in(...TRUNCATED)	{ "input": [ "3\nkek\npreceq\ncheburek\n", "4\nmail\nai\nlru\ncf\n" ], "output": [ "NO\n", "cfmailru\n" ] }	{ "input": [ "4\n4568\n4545992\n9265642\n4592886" ], "output": [ "13598\n27154740\n58212156\n27455323\n" ] }	{ "input": [], "output": [] }	2	12	{"language":[3,4,2,2,3,3,3,3,3,4,4,2,3,4,4,2,2,4,2,3,1,3,2,3,4,3,3,2,3,2,2,3,2,2,2,2,2,4,2,4,3,3,3,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	E	0	1,500	[]	false	null	256,000,000
385_A. Bear and Raspberry	"You and your friend are participating in a TV show \"Run For Your Prize\".\n\nAt the start of the s(...TRUNCATED)	{"input":["4\n3\n1 4 2\n1 3 1\n2\n2 4\n2 3\n2\n1 1000000000\n1 1000000000\n4\n3 10 5 8\n2 5 2 4\n"],(...TRUNCATED)	{"input":["6 4 2\n100010\n","4 2 1\n1000\n","8 5 2\n10000100\n","11 5 2\n11010000101\n","64 40 14\n1(...TRUNCATED)	{"input":["aabbaaaa\nbaaaaaab\n","cba\ncba\n","xnahfslefuigq\naaaaaaaaaaaaa\n","abcddd\ndddcab\n","a(...TRUNCATED)	2	7	{"language":[2,4,3,2,2,2,2,4,2,2,2,2,2,4,1,2,2,2,2,2,2,2,2,3,2,4,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,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,2,2,2,2,2,2,4,2,2,2,2,2(...TRUNCATED)	343	E	0	1,100	[ "" ]	false	{ "nanos": 0, "seconds": 4 }	256,000,000