Datasets:

TheFactoryX
/

edition_1410_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
bhavanas-and-bhuvanas-bet	"Emily's birthday is next week and Jack has decided to buy a present for her. He knows she loves boo(...TRUNCATED)	{"input":["9\ndo\nthe\nbest\nand\nenjoy\ntoday\nat\nacm\nicpc\n14\noh\nyes\nby\nfar\nit\nis\nwow\nso(...TRUNCATED)	{"input":["53812 4 967428361\n","7 2 400166453\n","75727 16 485722667\n","65536 10 802338989\n","655(...TRUNCATED)	{"input":["12 11\n11 12\n25 7\n","12 17\n6 19\n13 16\n","9 12\n3 17\n10 20\n","2 4\n1 3\n3 3\n","3 7(...TRUNCATED)	5	11	{"language":[2,2,2,2,2,2,4,2,3,2,2,2,4,2,2,4,4,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,3,3,2,2,3,2,4,3,3,2,2,4,4,4,2,4,4,4,4,3,2,4,3,2,2,2,2,2,3,2,2,2,2,2,3,4,4,4,2,4,2,4,3(...TRUNCATED)	0	B	0	0	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p01797 Kimagure Cleaner	"Utkarsh is forced to play yet another one of Ashish's games. The game progresses turn by turn and a(...TRUNCATED)	{"input":["10\n1 10 2 9 3 8 4 7 5 6\n","4\n1 2 3 4\n","3\n1 2 3\n"],"output":["4.500000000000024\n",(...TRUNCATED)	{"input":["3\n2 2 3\n","5\n1 4 5 4 5\n","4\n2 2 4 4\n","3\n1 1 2\n","4\n1 2 1 2\n","4\n4 2 2 4\n","6(...TRUNCATED)	{"input":["2\n4 INDIAN\nCONTEST_WON 1\nTOP_CONTRIBUTOR\nBUG_FOUND 100\nCONTEST_HOSTED\n1 NON_INDIAN\(...TRUNCATED)	2	8	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include<bits/stdc++.h>\nusing namespace std;(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,1,2,2,4,2,2,2,2,2,2,4(...TRUNCATED)	793		1,000	2,100	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
789_A. Anastasia and pebbles	"Sasha reaches the work by car. It takes exactly k minutes. On his way he listens to music. All song(...TRUNCATED)	{ "input": [ "3\n12 2\n200\n50\n300\n100" ], "output": [ "37" ] }	{"input":["1\n2\n999999997 999999998\n999999999 1000000000\n","4\n1\n1 1000000000\n5\n1 1\n12 18\n10(...TRUNCATED)	{"input":["8\n1 2\n1 3\n1 4\n1 5\n1 6\n2 7\n2 8\n","10\n10 1\n1 4\n4 2\n2 3\n3 6\n6 9\n9 5\n5 8\n3 7(...TRUNCATED)	6	0	{"language":[3,4,4,2,2,4,2,4,4,2,4,2,4,2,4,3,2,1,3,2,3,3,2,4,3,3,3,3,2,3,3,2,3,4,2,2,3,2,4,4,4,3,3,2(...TRUNCATED)	{"language":[2,2,4,2,4,2,4,4,1,4,3,4,2,4,1,4,3,4,2,3,3,2,4,3,4,3,4,4,2,3,3,1,3,2,2,4,2,2,4,4,1,2,4,3(...TRUNCATED)	40	D	0	900	[]	true		null	256,000,000
1081_D. Maximum Distance	"You are given a simple connected undirected graph G consisting of N vertices and M edges. The verti(...TRUNCATED)	{ "input": [ "2\n5 156\n16 40\n\nSAMPLE" ], "output": [ "Case 1: 6\nCase 2: 3\n" ] }	{ "input": [], "output": [] }	{"input":["5\n3\n1\n1\n3\n4\n5\n\nSAMPLE","5\n3\n1\n3\n3\n4\n5\n\nSAMPLE","5\n4\n1\n1\n3\n5\n5\n\nSA(...TRUNCATED)	2	13	{"language":[4,2,2,2,2,2,4,4,2,4,2,2,2,4,2,4,4,2,2,2,2,4,2,2,2,2,2,1,2,3,2,4,2,1,2,2,3,3,4,4,2,2,2,2(...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)	0	F	0	800	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
494_A. Treasure	"KM country has N kinds of coins and each coin has its value a_i.\n\nThe king of the country, Kita_m(...TRUNCATED)	{"input":["(((#)((#)\n","#\n","()((#((#(#()\n","(#)\n"],"output":["1\n2\n","-1\n","1\n1\n3\n","-1\n"(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5\n0 968804136\n0 736567537\n2 343136264\n0 259899572\n1 103950505\n","5\n0 51690939\n0 6(...TRUNCATED)	2	10	{"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],"solution":["t=int(input())\nwhile(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,3,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,0,3,2,2,2(...TRUNCATED)	0	B	0	0	[ "*special" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
nopc10	"Two students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs,(...TRUNCATED)	{ "input": [ "7\n", "9\n" ], "output": [ "210\n", "504\n" ] }	{ "input": [], "output": [] }	{"input":["1 15\n15\n1\n","1 22\n15\n1\n","1 15\n4\n1\n","4 3\n0 0 2 1\n2 0 1 0\n","1 15\n15\n2\n","(...TRUNCATED)	2	8	{"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],"sol(...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)	0		500	1,100	[ "divide and conquer", "fft", "greedy", "math", "number theory" ]	false	"Problem\n\n$n$枚のカードからなる束があり、下から$i$番目のカードには$i$が(...TRUNCATED)	{ "nanos": 0, "seconds": 3 }	0
p00163 Highway Toll	"Vasya is currently at a car rental service, and he wants to reach cinema. The film he has bought a (...TRUNCATED)	{ "input": [ "3 2 1\n1 2\n3\n", "10 8 2\n1 2 3 5 6 7 8 9\n3 5\n" ], "output": [ "-1", "2" ] }	{"input":["1\n2\n110 2\n115 112\n","10\n5\n88 60\n10 3\n48 21\n90 70\n40 88\n5\n20 81\n39 98\n34 87\(...TRUNCATED)	{"input":["7 4\n-10 -4 -2 0 2 4 10","16 19\n-49 -48 -33 -30 -21 -14 0 15 19 23 44 55 80 81 82 84","3(...TRUNCATED)	6	10	{"language":[4,1,4,3,1,4,4,2,2,4,2,2,2,2,4,1,2,1,4,4,2,4,4,4,4,4,4,2,4,2,2,2,4,2,4,2,4,2,4,2,2,4,2,4(...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)	0	D1	2,000	0	[ "combinatorics", "dp" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
1081_G. Mergesort Strikes Back	"G: Destiny Draw-\n\nproblem\n\nMr. D will play a card game. This card game uses a pile of N cards. (...TRUNCATED)	{"input":["1\n3\n1 2\n2 3\n1\n1\n1\n2\n2\n1\n","2\n6\n1 2\n1 3\n1 4\n4 5\n4 6\n4\n1 3 4 5\n3\n3 5 2\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1\n2 2\n1 1\n1 3\n","1\n1 3\n3\n1 2 0\n","5\n4 5\n10 8 6 4\n1 2 3 4 5\n1 1\n3\n3\n1 1\n3\(...TRUNCATED)	6	12	{"language":[1,1,2,2,2,2,2,2,2,3,2,4,4,2,2,2,2,4,2,2,2,2,2,2,4,2,4,1,4,2,2,2,2,2,4,2,4,4,4,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	851	D	0	1,900	[ "data structures", "dfs and similar", "shortest paths", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p00950 Infallibly Crack Perplexing Cryptarithm	"James Bond has a new plan for catching his enemy. There are some cities and directed roads between (...TRUNCATED)	{ "input": [ "2\n2\nbhopal\ndelhi\n3\nbhopal\ndelhi\ndehradun\n\nSAMPLE" ], "output": [ "YES\nNO\n" ] }	{ "input": [], "output": [] }	{"input":["26\n0.98 0.64 0.06 0.90 0.01 0.73 0.21 0.98 0.65 1.00 0.87 0.85 0.01 0.06 0.65 0.00 0.65 (...TRUNCATED)	6	0	{"language":[2,2,2,2,4,2,2,4,2,4,2,2,2,2,2,2,4,2,2,2,4,2,2,2,4,2,2,2,2,3,2,4,4,2,4,2,2,2,4,4,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,4,4,2,2,2,4,2,2,4,4,4,2,4,1,4,2,2,1,4,4,2,2,2,2,2,2,4,4,4,2,2,2,3,4,2,1,2,4,2,4,4(...TRUNCATED)	1,060		1,000	0	[ "" ]	true		{ "nanos": 0, "seconds": 1 }	1,073,741,824
79_D. Password	"Linda likes to change her hair color from time to time, and would be pleased if her boyfriend Archi(...TRUNCATED)	{"input":["5 1 5\n0\n3 3 3 3 3\n","4 3 4\n1 2 3\n1 10 100 1000\n","7 4 3\n2 4 5 6\n3 14 15\n","6 2 3(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["384\n87 78 16 94 36 87 93 50 22 63 28 91 60 64 27 41 27 73 37 12 69 68 30 83 31 63 24 68 (...TRUNCATED)	6	0	{"language":[3,3,3,3,3,3,3,1,1,3,3,4,3,3,3,2,1,2,3,3,3,2,3,3,3,3,4,3,2,3,3,3,3,3,3,4,3,3,3,2,3,3,3,3(...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,100		0	2,700	[ "binary search", "brute force", "implementation" ]	true		null	268,435,456