Datasets:

TheFactoryX
/

edition_0829_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
1354_C2. Not So Simple Polygon Embedding	"problem\n\nAOR Ika is studying to pass the test.\n\nAOR Ika-chan solved the $ N $ question. After t(...TRUNCATED)	{"input":["3 3\n1 3\n2 3\n3 3\n","3 1\n1 1\n2 2\n3 3\n","7 3\n1 7\n3 8\n4 5\n6 7\n1 3\n5 10\n8 9\n",(...TRUNCATED)	{"input":["2 1\n1 1\n","2 3\n3 1\n","100 5\n5 5 2 4 5 4 4 4 4 2 5 3 4 2 4 4 1 1 5 3 2 2 1 3 3 2 5 3 (...TRUNCATED)	{"input":["21\n11 19 4 19 6 0 13 7 6 2 5 3 16 16 1 9 15 21 9 21 2\n","100\n57 85 27 81 41 27 73 10 7(...TRUNCATED)	2	6	{"language":[1,4,2,4,2,3,4,4,2,4,3,4,2,2,4,4,3,1,2,1,1,2,4,2,4,4,4,4,2,4,4,2,2,3,2,4,2,2,2,4,1,1,2,3(...TRUNCATED)	{"language":[4,2,4,3,3,4,3,4,4,4,2,2,3,3,2,2,4,4,4,2,3,3,2,3,3,2,2,2,4,2,2,4,2,3,4,4,3,4,1,2,1,4,4,4(...TRUNCATED)	0	B	1,500	900	[]	false	{ "nanos": 0, "seconds": 1 }	0
25_D. Roads not only in Berland	"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 0 0\n0 1\n-1 2\n1 2\n","4 1 -1\n0 0\n1 2\n2 0\n1 1\n"],"output":["12.566370614359176\n"(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1100 0\n","6 6\n1 2 1 10\n2 3 1 10\n3 6 1 1\n1 4 1 6\n4 5 1 3\n5 6 1 3\n","4 4\n1 2 1 10\(...TRUNCATED)	5	12	{"language":[4,4,2,2,2,4,4,4,2,2,4,2,2,4,4,4,2,2,2,2,2,2,4,4,4,4,4,2,2,2,4,2,2,2,4,4,2,4,2,4,2,4,4,2(...TRUNCATED)	{ "language": [], "solution": [] }	746	F	1,500	2,300	[ "binary search", "brute force", "implementation" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
615_A. Bulbs	"There is a 120 minute videotape with standard recording. When I set the VCR counter to 00:00:00 wit(...TRUNCATED)	{"input":["4\n1000000000 1000000\n1000000000 1000000\n100000000 1000000\n1000000000 1000000\n","3\n9(...TRUNCATED)	{"input":["447244\n","958507\n","816923\n","836603\n","862795\n","756604\n","1000000\n","4\n","66882(...TRUNCATED)	{"input":["10\n1 3\n3 9\n27 81\n2187 6561\n9 27\n12641 19683\n81 243\n729 2187\n59049 177147\n531441(...TRUNCATED)	6	0	{ "language": [], "solution": [] }	{"language":[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,4,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2(...TRUNCATED)	0		500	0	[ "binary search", "dsu", "graphs", "shortest paths", "trees" ]	false	{ "nanos": 0, "seconds": 4 }	1,073,741,824
p00573 Commuter Pass	"You are practicing a juggle that involves in a number of square tiles. They all look the same in th(...TRUNCATED)	{ "input": [ "1 2 10\n11\n15 7\n", "2 4 50\n20 100\n60 10 40 80\n" ], "output": [ "7", "50" ] }	{ "input": [], "output": [] }	{"input":["1\n17\n","3\n10 7 14\n","3\n10 7 16\n","1\n7\n","1\n24\n","1\n9\n","1\n2\n","1\n10\n","3\(...TRUNCATED)	2	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,1,1,1,1,1,1,1,1,1,1,1,1],"s(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	0	E	500	2,500	[ "brute force", "math", "number theory" ]	false	{ "nanos": 0, "seconds": 1 }	0
252_B. Unsorting Array	"You are given a tree (a graph with n vertices and n - 1 edges in which it's possible to reach any v(...TRUNCATED)	{"input":["2 0\n1 1 1 1\n","2 2\n0 1 2 3\n2 5\n0 4\n","1 0\n2 3\n"],"output":["1.0000000000\n","1.50(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\naaba\n","2\nabaaaababb\n","2\naabbbccccbccdddddddd\n","3\naaaaadaaacccddddad\n","2\naa(...TRUNCATED)	2	8	{"language":[2,4,3,4,4,4,1,3,3,2,4,3,2,3,1,3,3,4,4,4,3,2,4,2,3,2,3,2,2,2,2,3,2,1,1,1,4,2,3,4,4,2,2,2(...TRUNCATED)	{"language":[0,3,0,2,4,0,0,4,0,0,3,1,3,4,0,2,2,0,2,3,2,2,4,4,0,3,4,4,4,2,0,0,2,0,2,3,0,0,0,0,0,0,2,0(...TRUNCATED)	1,374	E	1,750	2,500	[ "dsu", "math" ]	true	null	0
p04048 AtCoder Grand Contest 001 - Mysterious Light	"You are given a simple arithmetic expression of the form a?b, where a and b are integer constants, (...TRUNCATED)	{"input":["? - ? = 1\n","? + ? - ? + ? + ? = 42\n","? = 1000000\n"],"output":["Impossible\n","Possib(...TRUNCATED)	{"input":["100\n0 0 57 121 57 0 19 251 19 301 19 160 57 578 664 57 19 50 0 621 91 5 263 34 5 96 713 (...TRUNCATED)	{"input":["5 2 1\n0.1 0.2 0.3 0.5915213038191143 0.5\n6 2 2\n0.1 0.2 0.3 0.4 0.5 0.6\n0 0 0","5 2 1\(...TRUNCATED)	2	0	{"language":[2,4,3,2,2,3,2,2,4,4,4,2,2,2,2,2,2,4,2,2,3,2,2,4,2,1,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,3,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2,2,4,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,424		0	0	[ "greedy" ]	false	null	256,000,000
1030_E. Vasya and Good Sequences	Example Input 4 3 1 3 4 7 Output 6	{ "input": [ "3\n12 3 45\n", "2\n123 456\n" ], "output": [ "12330\n", "1115598\n" ] }	{"input":["10\n9 8 7 6 5\n","100\n41 13 29 11 25 15 6 23 28 50 48 17 3 9 44 24 5 19 34 22 33 32 20 1(...TRUNCATED)	{"input":["4 4","1 15","2 4","2 15","3 0","2 26","3 -1","2 32","0 -1","1 32","0 -2","1 17","-1 -2","(...TRUNCATED)	2	12	{"language":[1,1,1,1],"solution":["M,N=map(int,raw_input().split())\nL=[]\nfor i in range(M):\n L(...TRUNCATED)	{"language":[2,2,4,3,4,2,4,4,4,4,4,2,1,4,2,4,2,2,2,4,2,2,2,4,1,4,2,4,4,1,4,2,2,2,1,2,2,2,3,4,4,3,3,2(...TRUNCATED)	0		0	0	[ "brute force" ]	false	{ "nanos": 0, "seconds": 2 }	512,000,000
38_C. Blinds	"A tree is a connected graph without cycles.\n\nTwo trees, consisting of n vertices each, are called(...TRUNCATED)	{"input":["1 1\n4 10 0 0 10 0 10 10 0 10\n-5 -20 30 15\n135 45\n0 -15 15 0\n0 0"],"output":["11.213"(...TRUNCATED)	{"input":["5 1\n3 2\n","3 3\n1 2\n1 2\n1 2\n","5 3\n2 4\n5 4\n3 2\n","20 5\n3 12\n5 20\n16 4\n13 3\n(...TRUNCATED)	{"input":["xxoo\no.oo\nx...\nx..x\n","oo.x\nxo.o\nxx.o\n.oxx\n","xo..\nxo.x\no.xo\nxoox\n","..ox\n..(...TRUNCATED)	3	14	{"language":[1],"solution":["testcase = raw_input();\ntc = int(testcase)\n\nwhile (tc > 0):\n\t\n\t(...TRUNCATED)	{"language":[2,2,3,2,3,2,2,0,4,0,0,2,2,4,2,3,2,2,3,3,3,2,0,2,3,2,2,2,3,2,0,0,2,3,2,3,3,0,2,0,2,0,3,3(...TRUNCATED)	0	F	0	0	[ "combinatorics", "number theory" ]	false	{ "nanos": 0, "seconds": 6 }	256,000,000
p03819 AtCoder Regular Contest 068 - Snuke Line	"Given the value of n, print the n'th prime number.\n\nInput : A single integer n. \nOutput : A sing(...TRUNCATED)	{ "input": [ "3\n2 3 3\n", "4\n0 1 2 3\n", "6\n5 2 0 5 2 1\n" ], "output": [ "0\n", "10\n", "53\n" ] }	{"input":["9 12\n1 2\n2 3\n4 5\n5 6\n6 7\n7 8\n1 4\n4 7\n2 5\n5 8\n3 6\n6 9\n","5 4\n2 1\n3 2\n4 3\n(...TRUNCATED)	{"input":["9 10\n1 2 3 4 5 6 7 8 9\n1 2\n2 1\n2 4\n3 4\n4 5\n4 6\n2 7\n7 8\n7 9\n9 1","16 19\n1 2 3 (...TRUNCATED)	2	15	{"language":[2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace std;\n\(...TRUNCATED)	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	E	0	1,900	[ "data structures", "graphs" ]	false	{ "nanos": 0, "seconds": 2 }	512,000,000
1446_D2. Frequency Problem (Hard Version)	"Emily's birthday is next week and Jack has decided to buy a present for her. He knows she loves boo(...TRUNCATED)	{ "input": [ "3 2 1\n", "3 2 2\n", "4 2 2\n" ], "output": [ "2\n", "4\n", "4\n" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	0	{"language":[1,3,2,2,2,3,4,2,4,3,3,3,2,3,1,3,3,3,3,3,3,2,3,4,3,3,4,3,3,3,3,3,4,3,4,2,3,3,2,3,4,3,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,4,2,2(...TRUNCATED)	0		0	1,700	[ "dsu", "graphs", "shortest paths", "sortings" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000