Datasets:

TheFactoryX
/

edition_0454_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
319_B. Psychos in a Line	"Apple adventure\n\nsquare1001 and E869120 got lost in the grid world of $ H $ rows and $ W $ rows!\(...TRUNCATED)	{ "input": [ "ppqb", "pdbq" ], "output": [ "No", "Yes" ] }	{ "input": [ "aaaa a", "abcd cb", "a abab" ], "output": [ "4\n", "0\n", "0\n" ] }	{"input":["10\n3\n-15 -33 79\n16\n45 -84 19 85 69 -64 93 -70 0 -53 2 -52 -55 66 33 -60\n2\n14 -2\n4\(...TRUNCATED)	2	11	{"language":[2,2,2,3,2,2,2,3,4,3,2,2,3,2,4,3,2,2,2,3,3,3,2,3,3,2,2,3,2,2,1,2,3,2,3,4,4,3,2,2,2,2,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,4,2,0,2,2,4,2,2,2,2,2,4,2,2,2,2,0,2,2,2],"solution":["#include <bits/(...TRUNCATED)	925	E	0	2,200	[]	false	{ "nanos": 0, "seconds": 2 }	0
xenny-and-range-sums	"Andrew plays a game called \"Civilization\". Dima helps him.\n\nThe game has n cities and m bidirec(...TRUNCATED)	{ "input": [ "3\n2 3 4\n2 1\n1\n-1\n" ], "output": [ "56\n" ] }	{"input":["72\n111101100111001110000000100010100000011011100110001010111010101011111100\n","3\n101\n(...TRUNCATED)	{"input":["5\nAJMP\naB33d\nE\n86AE\nAM\n6\nJPEM\nWaEaETC302Q\nCP\nrTurnAGundam1isdefferentf","5\nAJM(...TRUNCATED)	6	8	{"language":[2,2,4,4,2,2,2,2,2,2,2,4,2,4,4,2,2,4,2,4,4,4,2,2,4,4,2,2,2,3,2,4,4,4,2,2,2,2,2,4,2,2,2,4(...TRUNCATED)	{"language":[2,4,4,3,2,2,2,2,3,4,4,4,4,2,2,4,3,4,2,3,4,2,2,4,1,2,2,1,2,4,4,3,2,3,2,4,4,2,4,2,1,4,1,2(...TRUNCATED)	124	B	2,500	0	[ "trees" ]	false	{ "nanos": 0, "seconds": 8 }	512,000,000
1117_F. Crisp String	"Friends Alex and Bob live in Bertown. In this town there are n crossroads, some of them are connect(...TRUNCATED)	{"input":["2 1 0\n","2 2 4\n0 1 2 1\n0 1 2 1\n1 2 1 0\n1 1 1 2\n"],"output":["FIRST\n1 0 1 1\n","SEC(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 1\n4 10 0 0 9 0 10 10 0 10\n-5 -20 30 15\n135 45\n0 -15 15 0\n0 0","1 1\n4 10 0 0 9 0 1(...TRUNCATED)	1	10	{"language":[4,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,3,2,2,4,4,4,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	{"language":[2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2(...TRUNCATED)	0	E	500	2,300	[]	false	{ "nanos": 0, "seconds": 4 }	0
1030_E. Vasya and Good Sequences	"Jack is the most intelligent student in the class.To boost his intelligence,his class teacher gave (...TRUNCATED)	{ "input": [ "0", "0011", "11011010001011" ], "output": [ "0", "4", "12" ] }	{"input":["61\n17357774\n248290406\n171408490\n20054376\n118774144\n110228788\n8827234\n85304880\n15(...TRUNCATED)	{"input":["5 10\n1 2\n1 3\n2 2 4\n1 5\n0\n1\n","6 6\n1 2\n2 3 6\n1 4\n1 6\n1 1\n0\n1\n","6 6\n2 4 3\(...TRUNCATED)	2	7	{"language":[2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace std;\n#defi(...TRUNCATED)	{ "language": [], "solution": [] }	1,046	B	1,750	0	[ "" ]	true	{ "nanos": 0, "seconds": 3 }	256,000,000
228_D. Zigzag	"You have a Petri dish with bacteria and you are preparing to dive into the harsh micro-world. But, (...TRUNCATED)	{"input":["4 4 2\n2 3\n1 2\n1 3\n1 4\n","5 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n","5 7 2\n1 (...TRUNCATED)	{"input":["9\n","8\n","6\n","4\n","7\n","5\n","2\n"],"output":["1 2 3 4 5 6 7 8 \n2 4 6 8 (...TRUNCATED)	{"input":["5 10\n2 1 2 2 2\n2\n2 4\n4 5\n","5 10\n2 1 2 2 1\n2\n2 4\n4 5\n","5 10\n3 1 4 2 1\n2\n2 4(...TRUNCATED)	6	12	{"language":[4,2,2,2,2,2,3,4,2,4,4,2,3,4,4,2,4,2,1,2,4,2,4,2,2,4,4,2,2,2,4,4,2,4,3,4,2,4,4,3,2,1,4,2(...TRUNCATED)	{"language":[4,2,2,2,2,2,4,2,2,4,2,2,4,2,4,2,2,2,2,4,2,2,4,2,4,2,4,4,4,3,4,2,2,2,2,2,2,2,3,2,2,2,2,1(...TRUNCATED)	846	E	1,000	1,500	[ "constructive algorithms", "graphs", "math", "shortest paths", "sortings" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
621_D. Rat Kwesh and Cheese	"Every day Kotlin heroes analyze the statistics of their website. For n days, they wrote out n numbe(...TRUNCATED)	{ "input": [ "2\n1 2\n1 2\n" ], "output": [ "\n12\n" ] }	{"input":["20\n76 86 70 7 16 24 10 62 26 29 40 65 55 49 34 55 92 47 43 100\n","100\n6591 1074 3466 3(...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	11	{"language":[1],"solution":["from collections import deque\nclass Frog():\n\t\n\tdef __init__(self,n(...TRUNCATED)	{"language":[2,2,2,2,2,4,3,3,2,4,2,2,2,2,2,2,2,2,2,4,2,3,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,4,2,2,3,2,2,2(...TRUNCATED)	0		2,000	800	[]	false	{ "nanos": 0, "seconds": 2 }	134,217,728
592_E. BCPC	"You have two friends. You want to present each of them several positive integers. You want to prese(...TRUNCATED)	{ "input": [ "2\n5 156\n16 40\n\nSAMPLE" ], "output": [ "Case 1: 6\nCase 2: 3\n" ] }	{ "input": [], "output": [] }	{"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)	2	8	{"language":[3,2,2,2,4,2,2,2,3,3,2,2,4,2,2,2,2,4,2,2,2,2,2,4,2,4,4,2,2,2,2,4,2,4,3,2,2,2,4,2,4,2,2,2(...TRUNCATED)	{"language":[4,3,1,4,1,4,3,2,2,2,4,3,3,2,4,3,2,2,2,2,4,4,2,2,2,4,2,3,4,4,2,3,3,2,3,4,3,3,2,4,2,2,3,4(...TRUNCATED)	0	F	2,500	1,800	[]	false	{ "nanos": 0, "seconds": 2 }	0
p01484 Icy Composer	"We have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, r(...TRUNCATED)	{ "input": [ "2\n" ], "output": [ "25\n" ] }	{"input":["100\n92 53 86 41 77 68 80 54 17 96 89 53 64 55 2 80 28 58 77 43 70 91 71 71 78 3 25 2 15 (...TRUNCATED)	{"input":["5\n2 1 1 1 2\n","6\n5 1 3 4 8 3\n","5\n1 5 7 1 2\n","6\n5 1 3 4 5 3\n","2\n1000010 100100(...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,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,0,2,2,2,2,2,1,2,2,2,2,2,2,2,1,2,2,2,2,0,2,0,0,2,0,0,0,4,1,2,2,0,2,0,0,2,2,2,0,2,2,2,2(...TRUNCATED)	1,149	B	500	2,300	[ "implementation" ]	false	null	0
professor-sharma	"Every day Ruslan tried to count sheep to fall asleep, but this didn't help. Now he has found a more(...TRUNCATED)	{ "input": [ "3\nDSAWWAW\nD\nWA\n" ], "output": [ "8\n2\n4\n" ] }	{"input":["2 1\n1000000000 1000000000\n2 1\n","3 2\n123 345 567\n1 2\n3 2\n","3 0\n4 1 4\n","3 2\n1 (...TRUNCATED)	{"input":["6\n773209925 62005863 473635171 329666981 510631133 207643327\n","1\n2\n","7\n481003311 5(...TRUNCATED)	3	10	{"language":[1],"solution":["for _ in xrange(input()):\n n= input()\n a=map(int,raw_input().sp(...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)	0	A	1,750	2,200	[ "brute force", "greedy", "math" ]	false	{ "nanos": 0, "seconds": 8 }	268,435,456
mind-palaces-3	"The nation of Panel holds an annual show called The Number Games, where each district in the nation(...TRUNCATED)	{ "input": [ "6\n2 3 1 3 2 4\n2\n1 0 4\n2 3 5\n\nSAMPLE" ], "output": [ "2\n-1" ] }	{ "input": [], "output": [] }	{"input":["4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 2\n3 0 1\n3 1 5","6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1(...TRUNCATED)	3	0	{"language":[3,2,2,2,3,3,4,3,3,4,2,3,2,4,2,2,4,2,2,2,2,4,3,2,3,2,2,4,4,4,2,2,2,3,3,2,3,3,2,3,2,2,3,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,037	B	0	0	[]	false	{ "nanos": 0, "seconds": 2 }	256,000,000