Datasets:

TheFactoryX
/

edition_1236_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
colarr	"Draco Malfoy and Hermione Granger have gotten into a \"battle of brains\". Draco was foolish enough(...TRUNCATED)	{ "input": [ "2\n2\nbhopal\ndelhi\n3\nbhopal\ndelhi\ndehradun\n\nSAMPLE" ], "output": [ "YES\nNO\n" ] }	{ "input": [], "output": [] }	{"input":["10000 01000 00100 11000 01100 11111 01110 11100 10110 11110\n10101 01000 00000 11001 0110(...TRUNCATED)	6	10	{"language":[4,3,2,4,3,2,3,2,2,4,2,4,3,3,2,3,2,2,2,3,3,3,3,3,3,3,3,2,4,3,3,4,3,3,3,4,3,3,3,4,3,3,3,3(...TRUNCATED)	{"language":[2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,1,2,2,4,2,2,2,2,2,2,2,4,2,4(...TRUNCATED)	1,397	B	0	1,800	[ "" ]	false	{ "nanos": 0, "seconds": 3 }	1,073,741,824
937_D. Sleepy Game	"Step up and down\n\nKazuki, commonly known as Kerr, who attends JAG University, was invited by your(...TRUNCATED)	{ "input": [ "4\n4 4\n1000000000 0\n7 15\n8 7\n" ], "output": [ "2\n0\n7\n5\n" ] }	{"input":["1 1\n1\n2\n","6 3\n1 2 3 4 5 6\n3 5 1\n","5 5\n5 6 3 2 1\n4 3 1 5 6\n","1 1\n1\n1\n","10 (...TRUNCATED)	{"input":["4\n3\n1 4 2\n1 3 1\n2\n2 4\n2 3\n2\n1 1100000000\n1 1000000000\n4\n3 10 5 8\n2 5 2 4\n","(...TRUNCATED)	5	11	{"language":[1],"solution":["import sys\n\nfor __ in range(input()) :\n n , k = map(int,sys.stdin(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,2,2,4,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,2,2,2,2,2,2,2(...TRUNCATED)	39	B	0	1,700	[]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
44_B. Cola	"You are given a square with 'n' points on each side of the square. None of these points co-incide w(...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":["3 3 1\n","300 2 300\n","4000 4000 1\n","4000 4000 100\n","4 2 3\n","3 300 300\n","4000 10(...TRUNCATED)	{"input":["3\nfdSgAe\nOut\nGet\n\nSAMPLE","3\nfdSgAe\ntuO\nFet\n\nSAMPLE","3\nBdSgfe\ntuO\nFet\n\nSA(...TRUNCATED)	2	8	{"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":[4,2,1,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,0,0,2,2,2,2,4,2,2,2,3,0,2,2],(...TRUNCATED)	962		0	1,800	[ "geometry" ]	false	{ "nanos": 0, "seconds": 3 }	268,435,456
615_A. Bulbs	"Taro is an elementary school student who has just learned multiplication. Somehow, he likes multipl(...TRUNCATED)	{ "input": [ "3 8\n6 5 8\n", "7 20\n21 15 12 11 20 19 12\n" ], "output": [ "2\n", "6\n" ] }	{"input":["4\n39 20\n183 11\n551 27\n85 16","8\n4 65\n5 12\n7 24\n9 38\n12 24\n14 10\n65 75\n31 26"](...TRUNCATED)	{"input":["1 10\n778084 -205153\n778001 -205093\n778155 -205118\n778168 -204997\n778066 -205141\n778(...TRUNCATED)	1	7	{"language":[2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace std;\n\(...TRUNCATED)	{"language":[3,2,1,2,3,2,2,3,4,2,2,2,2,3,2,2,2,2,4,2,4,2,2,2,3,3,2,2,3,4,4,4,1,4,2,2,3,2,4,2,2,2,4,4(...TRUNCATED)	488	A	1,000	0	[ "brute force", "implementation", "strings" ]	false	{ "nanos": 0, "seconds": 3 }	0
996_F. Game	"Your task is very simple. Given K numbers A1, A2, ..., AK. You need to find f(N) mod max(A1, A2, .(...TRUNCATED)	{ "input": [ "5\n1 4 3 5 2", "9\n1 2 4 9 5 8 7 3 6", "2\n1 2", "2\n2 1" ], "output": [ "2", "3", "1", "0" ] }	{"input":["21\n11 19 4 19 6 0 13 7 6 2 5 3 16 10 1 9 15 21 9 21 2\n","100\n57 85 27 81 41 27 73 10 7(...TRUNCATED)	{"input":["1\n7\n.......\n.*.....\n.......\n.......\n.......\n.......\n.......\n\nSAMQLE","1\n5\n...(...TRUNCATED)	2	8	{"language":[2,2,2,4,4,3,4,2,2,4,3,2,2,2,2,2,1,4,2,2,2,2,2,2,2,4,4,4,4,4,4,4,4,4,2,2,2,4,2,2,2,4,4,2(...TRUNCATED)	{ "language": [], "solution": [] }	0		30	0	[ "data structures", "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
571_B. Minimization	"Sita loves chocolate and Ram being his boyfriend wants to give Sita as many chocolates as he can. S(...TRUNCATED)	{ "input": [ "500 100 1000", "19 123 143", "19 123 142", "50 100 120" ], "output": [ "No", "No", "Yes", "Yes" ] }	{ "input": [], "output": [] }	{"input":["3 9 1\n2 3 8","2 1000000000 1000000000\n1 199586132","3 9 3\n1 3 7","3 9 3\n1 0 7","2 100(...TRUNCATED)	2	10	{"language":[1],"solution":["t = int(raw_input())\nfor _ in range(t):\n\tn, a, b, c = map(int, raw_i(...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],"sol(...TRUNCATED)	151	D	0	2,400	[ "dfs and similar", "graphs", "trees" ]	false	null	256,000,000
1470_E. Strange Permutation	"You are given a permutation p_1, p_2, …, p_n.\n\nIn one move you can swap two adjacent values.\n\(...TRUNCATED)	{"input":["5 4 10 1 6\n1 1 5\n1 5 5\n1 3 2\n1 5 2\n2 1\n2 2\n","5 2 2 1 8\n1 1 2\n1 5 3\n1 2 1\n2 2\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["180 100 100 100 100\n","103 83 11 4 93\n","100 000 100 100 100\n","180 000 100 100 100\n"(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2,2,3,2,2,2,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,2,2,2,4,2(...TRUNCATED)	{"language":[3,2,2,2,2,2,3,2,2,2,2,2,2,3,2,2,2,3,2,2,3,2,2,2,3,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	0	E	0	2,300	[ "constructive algorithms", "dfs and similar", "dsu", "graphs", "matrices" ]	false	null	134,217,728
1003_D. Coins and Queries	"Takahashi is participating in a programming contest called AXC002, and he has just submitted his co(...TRUNCATED)	{"input":["3 1 4\n","2 2 10\n","5 5 16808\n","1 4 10\n"],"output":["Stas\n\n","Masha\n\n","Masha\n\n(...TRUNCATED)	{"input":["10\n5 1 33242121\n5 7 535463871\n9 1 202863787\n5 4 874413088\n6 1 623012241\n6 8 7866591(...TRUNCATED)	{ "input": [], "output": [] }	2	1	{"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)	{ "language": [], "solution": [] }	1,374		0	0	[ "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1490_G. Old Floppy Drive	"Each item in the game has a level. The higher the level is, the higher basic parameters the item ha(...TRUNCATED)	{ "input": [ "2 3\n", "1 1\n", "49 1808\n" ], "output": [ "6\n", "0\n", "359087121\n" ] }	{"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": [], "output": [] }	2	10	{"language":[4,2,3,3,4,4,4,2,2,2,2,3,4,3,2,4,3,4,4,2,4,4,3,2,4,3,4,3,4,4,3,3,2,4,2,4,2,4,4,3,4,4,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	500	D	1,000	2,800	[ "data structures", "string suffix structures" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1455_F. String and Operations	"I have n tickets for a train with a rabbit. Each ticket is numbered from 0 to n − 1, and you can (...TRUNCATED)	{"input":["1\n0\n","6\n2 0 3 0 1 1\n","6\n3 2 2 2 1 1\n"],"output":["0\n\n","5\n6 6\n5 5\n4 3\n4 5\n(...TRUNCATED)	{"input":["2 3\n1 1 1\n0 1 0","2 2\n1 0\n0 1","3 3\n0 1 0\n1 0 1\n0 1 0","2 2\n0 0\n1 0","2 2\n0 1\n(...TRUNCATED)	{"input":["3\n3 1 0\n1 2 6\nXOR\n3 1 0\n1 2 3\nAND\n3 1 0\n1 2 3\nOR","3\n3 1 0\n1 2 3\nXOR\n3 1 0\n(...TRUNCATED)	6	12	{"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":[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)	0	D	0	1,900	[ "*special", "graphs" ]	false	{ "nanos": 0, "seconds": 1 }	64,000,000