Datasets:

TheFactoryX
/

edition_0464_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
1428_D. Bouncing Boomerangs	"Takahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dis(...TRUNCATED)	{"input":["10\n10\n3 7\n1 4\n1 6\n5 5\n1 1\n3 9\n7 8\n1 2\n3 3\n7 10\n10\n2 4\n1 7\n3 4\n3 5\n2 8\n2(...TRUNCATED)	{"input":["#(#(#((##((()))(((#)(#()#(((()()(()#(##(((()(((()))#(((((()(((((((()#((#((()(#(((()(()##((...TRUNCATED)	{"input":["2\n0 1\n","5\n0 0 1 0 1\n","100\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 (...TRUNCATED)	2	8	{"language":[4,4,4,4,3,3,2,2,4,3,4,2,4,4,4,2,3,2,4,3,3,2,4,3,2,1,2,2,4,4,2,3,3,2,3,2,3,3,2,3,3,4,1,4(...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)	0	D	1,250	1,300	[ "dp" ]	false	{ "nanos": 0, "seconds": 2 }	0
663_A. Rebus	"Tree is a connected acyclic graph. Suppose you are given a tree consisting of n vertices. The verte(...TRUNCATED)	{ "input": [ "5\n2 3 4 6 8" ], "output": [ "1" ] }	{"input":["1\n2 2\n1 1\n1 2\n","1\n1 3\n3\n1 2 3\n","1\n1 1\n1000\n1000\n","1\n2 2\n2 2\n2 2\n","5\n(...TRUNCATED)	{"input":["2 3\n1 0\n4 9\n","4 10\n2 2 2 1\n960 2596 3752 8303\n","6 10\n0 3 3 5 4 5\n4845 6494 579 (...TRUNCATED)	3	7	{"language":[1],"solution":["# your code goes here\nfrom sys import stdin, stdout\nt = int(stdin.rea(...TRUNCATED)	{ "language": [], "solution": [] }	741	C	2,000	2,000	[ "data structures", "trees" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
277_C. Game	Example Input 2 1 1 2 2 Output 1	{"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":["7 9 999999999 0 3\n0 1 0\n1 2 0\n2 3 0\n0 4 1\n4 1 1\n1 5 499999999\n5 2 499999999\n2 6 1(...TRUNCATED)	{"input":["30\n10 1 8 10 2 6 37 7 3 7 1 3 1 1 14 2 5 19 4 1 13 3 5 6 1 5 1 1 23 1\n98 4 43 41 56 58 (...TRUNCATED)	1	0	{"language":[2,2,2,2,2,2,2,4,2,2,1,4,2,2,2,2,4,2,4,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	C	0	3,000	[ "graphs" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
820_A. Mister B and Book Reading	"Princess Heidi decided to give orders to all her K Rebel ship commanders in person. Unfortunately, (...TRUNCATED)	{"input":["20 40 60 80 100\n0 1 2 3 4\n1 0\n","119 119 119 119 119\n0 0 0 0 0\n10 0\n"],"output":["4(...TRUNCATED)	{"input":["80\n72 66 82 46 44 22 63 92 71 65 5 30 45 84 29 73 9 90 25 19 26 15 12 29 33 19 85 92 91 (...TRUNCATED)	{"input":["4\n11833\n5512\n100\n28436\n33903\n100\n84816\n75747\n100\n92281\n31380\n100","1\n45819\n(...TRUNCATED)	2	11	{"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":[4,4,1,3,4,1,4,2,3,4,3,1,3,2,4,4,4,1,1,3,2,4,4,4,2,2,4,2,4,2,4,4,1,2,2,4,1,1,4,4,2,2,4,3(...TRUNCATED)	0		1,000	0	[]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
p02741 Panasonic Programming Contest 2020 - Kth Term	"There are N+1 lights. Lights are placed at (0, 0), (1, 0), (2, 0) ... (N, 0). Initially all the li(...TRUNCATED)	{ "input": [ "5\n0 1 2 1 2\n", "4\n0 1 2 3\n" ], "output": [ "YES\n1\n2\n3\n5\n4\n", "NO\n" ] }	{ "input": [], "output": [] }	{"input":["15 6\n1 6 6 5 2 10 4 4 14 8 7 3 5 1 2\n","65 7\n1 5 4 1 4 11 9 1 11 7 6 11 9 4 2 6 10 11 (...TRUNCATED)	6	10	{"language":[2,4,2,4,1,2,2,2,2,2,3,3,2,2,3,2,4,3,2,4,2,4,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,2,2,2,4,4,4,4,4,2,2,2,2,2,1,4,3,4,2,2,4,2,2,2,4,2,4,4,2,1,2,1,2,2,2,4,1,2,2,2,2,3,3(...TRUNCATED)	1,081		0	1,400	[ "*special" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1149_E. Election Promises	"You are running through a rectangular field. This field can be represented as a matrix with 3 rows (...TRUNCATED)	{"input":["6 5\n20 15 10 15 20 25\n","7 1\n101 53 42 102 101 55 54\n","7 1000000\n1 1 1 1 1 1 1\n"],(...TRUNCATED)	{"input":["1 0\n1 1 0\n1 446844829 77109657 780837560\n1 754808995 539371459\n","1 1\n1 1\n2 2 0\n1 (...TRUNCATED)	{"input":["1\n1 3311995\n","1\n1000001000 1\n","10\n588 12\n560 10\n593 14\n438 15\n761 11\n984 6\n5(...TRUNCATED)	2	11	{"language":[2,4,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,4,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,4,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,4,3,2,2,2,2,2,2,3,2,2,2(...TRUNCATED)	1,199		2,500	2,400	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
1129_D. Isolation	"The rebels have saved enough gold to launch a full-scale attack. Now the situation is flipped, the (...TRUNCATED)	{"input":["10000\n5000 3150\n5000 5000\n0 0\n5000 1050\n5000 3980\n5000 210\n5000 5000\n5000 5000\n0(...TRUNCATED)	{"input":["2 0\n","100000 0\n","8 9\n1 2\n2 3\n3 4\n4 1\n5 6\n6 7\n7 8\n8 5\n6 8\n","2 1\n1 2\n","11(...TRUNCATED)	{"input":["4 4 3\n1 2 3\n1 2 1\n2 3 3\n1 3 3\n1 4 4\n","5 4 2\n4 5\n1 2 100\n1 3 100\n3 4 10\n3 5 20(...TRUNCATED)	2	8	{"language":[2,2,4,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,1,2,2,2,2,2,2,2,4,2,2,2,2,4,2(...TRUNCATED)	{"language":[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,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	331	A2	0	2,300	[ "dp", "greedy", "strings" ]	false	{ "nanos": 0, "seconds": 3 }	134,217,728
p03943 AtCoder Beginner Contest 047 - Fighting over Candies	"The Chef likes to stay in touch with his staff. So, the Chef, the head server, and the sous-chef al(...TRUNCATED)	{ "input": [ "4\n2 5\n9 7\n15 6\n9 3" ], "output": [ "3" ] }	{"input":["66\n","652615\n","482331\n","336161\n","33\n","1000000\n","79531\n","768208\n","3\n","885(...TRUNCATED)	{"input":["1000\n999001\n999002\n999003\n999004\n999005\n999006\n999007\n999008\n999009\n999010\n999(...TRUNCATED)	5	10	{"language":[2,4,4,2,2,2,4,2,3,2,2,2,4,3,2,4,3,1,1,2,3,4,2,2,4,2,3,3,1,4,4,3,1,3,1,2,2,2,1,4,4,4,3,3(...TRUNCATED)	{"language":[0,2,2,0,2,3,2,3,4,0,3,2,2,2,2,2,2,3,0,2,0,2,3,4,0,2,2,0,2,2,2,2,2,2,3,0,3,2,2,0,0,2,2,2(...TRUNCATED)	354		0	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p01538 Kakezan	"You are given a number n. Print n lines, i-th line should consist of i characters \"*\". Lines' ind(...TRUNCATED)	{ "input": [ "4\n4 4\n1000000000 0\n7 15\n8 7\n" ], "output": [ "2\n0\n7\n5\n" ] }	{"input":["1 0\n23333\n","3 3\n1 1 1\n1 2\n2 3\n3 1\n","5 4\n1 2 2 2 2\n1 2\n1 3\n1 4\n1 5\n","10 30(...TRUNCATED)	{"input":["14\n4 9\n3 7\n4 1\n3 2\n14 9\n7 6\n10 13\n8 7\n5 7\n7 10\n1 3\n12 3\n7 11\n20\n13 6 14 9 (...TRUNCATED)	1	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,3,2,2,3,2,2,3,2,2,2,3,2,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)	1,208	D	0	2,600	[ "constructive algorithms", "graphs", "greedy", "sortings" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
1007_E. Mini Metro	"The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the (...TRUNCATED)	{"input":["2\n10 1\n1 2 -3 -5 4 6 -3 2 -1 2\n10 2\n1 2 -3 -5 4 6 -3 2 -1 2\n\nSAMPLE"],"output":["12(...TRUNCATED)	{ "input": [ "1\n999838675\n" ], "output": [ "-1\n" ] }	{"input":["0.0,0.0,1.0,0.0,1.0,1.0,0.0,0.1\n0.0,0.0,3.0,0.0,1.0,1.0,1.0,3.0","1.0,0.0,0.1,0.1,0.0,0.(...TRUNCATED)	2	0	{"language":[4,2,2,4,2,2,2,2,4,2,3,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,1,4,2,2,2,4,2,2,4,2,2,2,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,4,2,4,2,0,3,2,0,2,4,2,3,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace s(...TRUNCATED)	0	A	0	1,600	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	512,000,000