Datasets:

TheFactoryX
/

edition_1002_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
167_C. Wizards and Numbers	"Chouti was tired of the tedious homework, so he opened up an old programming problem he created yea(...TRUNCATED)	{ "input": [ "5\n7 46 11 20 11", "7\n994 518 941 851 647 2 581", "3\n3 4 6" ], "output": [ "90", "4527", "10" ] }	{"input":["10 9\n7 9\n8 9\n8 2\n10 6\n8 3\n9 4\n2 6\n8 5\n9 1\n","2 1\n1 2\n","20 20\n1 9\n11 9\n3 5(...TRUNCATED)	{"input":["ABM","BIB","1MI","MCA","MAC","M@C","C@M","@MC","?MC","M?C","C?M","CM?","DM?","?MD","@MD",(...TRUNCATED)	5	9	{"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,3,2(...TRUNCATED)	{"language":[2,2,2,4,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,4,2,2,2,2,4,2,2,4,2,2,4(...TRUNCATED)	1,304	D	2,750	0	[ "greedy", "implementation", "math", "ternary search" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
reversemerge-shuffle-reverse	"Monocarp and Polycarp are learning new programming techniques. Now they decided to try pair program(...TRUNCATED)	{ "input": [ "1\n4 2\n6 1 2 0\n\nSAMPLE" ], "output": [ "3\n" ] }	{ "input": [], "output": [] }	{"input":["5\ncbbbb\nbcbab\naacbb\naaacb\naaaac\n","20\nbifcabiabgfibfccdbgd\ncffaheagahcbacafbgeb\n(...TRUNCATED)	2	7	{"language":[2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,4,2,2,4,4,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	C	0	900	[ "" ]	false	"Problem\n\nマイヅ大学にある大規模クラスタ†型スーパーコンピュータ（通(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000
1285_C. Fadi and LCM	"Some time ago Mister B detected a strange signal from the space, which he started to study.\n\nAfte(...TRUNCATED)	{ "input": [ "??00????0??0????0?0??00??1???11?1?1???1?11?111???1", "0??0", "0??" ], "output": [ "4", "2", "1" ] }	{ "input": [], "output": [] }	{"input":["5\n12\n5 4 4 3 2 2 1 1 1 1 1 1\n4\n4 3 2 1\n1\n1000000\n20\n20 19 18 17 16 15 14 13 12 11(...TRUNCATED)	2	0	{"language":[4,2,2,2,2,3,2,2,4,2,3,2,2,4,4,2,2,4,2,2,2,4,4,2,2,2,2,3,2,3,4,2,3,4,2,2,2,2,4,4,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2],"solution":["#include <iostream>\n#include <cstdio>\n#include <vector>\n#inc(...TRUNCATED)	709		0	2,100	[]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
178_A1. Educational Game	"There are N oases on a number line. The coordinate of the i-th oases from the left is x_i.\n\nCamel(...TRUNCATED)	{"input":["5 5 2\n#####\n#A#B#\n# #\n#b#a#\n#####\n16 4 3\n################\n## ########## ##\n# (...TRUNCATED)	{"input":["53812 4 967428361\n","7 2 400166453\n","75727 16 485722667\n","65536 10 802338989\n","655(...TRUNCATED)	{"input":["2\nacxz\nzxcb","2\nzxda\nzxcb\n\nSAMPLE","2\nzwac\nbcyz","2\nywac\nbcyz","2\nzxca\nbcxz\n(...TRUNCATED)	6	11	{"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": [], "solution": [] }	39	B	0	0	[ "graphs", "greedy", "shortest paths" ]	false		{ "nanos": 0, "seconds": 2 }	0
990_B. Micro-World	"There are N students and M checkpoints on the xy-plane.\nThe coordinates of the i-th student (1 \\l(...TRUNCATED)	{ "input": [ "0 1 1 1 1 0\n", "1 1 0 0 1000 1000\n" ], "output": [ "Yes\n", "No\n" ] }	{ "input": [], "output": [] }	{"input":["20 101 100\n1 14 20 3 19 10 12 18 4 17 13 6 8 5 2 15 7 16 9 11\n69 53 101 100 41 38 63 84(...TRUNCATED)	3	2	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,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,4(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,2,2,2,2,1,4,3,2,2,2,2,2,1,2,3,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,257		1,750	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
1500_B. Two chandeliers	"You are given an equation: \n\nAx2 + Bx + C = 0. \n\nYour task is to find the number of distinct ro(...TRUNCATED)	{ "input": [ "4\n7 2 4 12\n7 15 10 12\n", "3\n4 4 4\n1 2 3\n" ], "output": [ "Yes\n", "No\n" ] }	{"input":["100\n04\n9\n02163\n003000\n08041479\n80750340926070052\n90056\n11680\n90\n090208090090209(...TRUNCATED)	{"input":["5\n1 4 5 4 4\n","4\n3 2 3 2\n","3\n1 1 3\n","4\n1 1 3 1\n","6\n1 2 5 4 5 5\n","5\n1 2 3 4(...TRUNCATED)	2	12	{"language":[4,4,4,4,4,4,4,3,3,2,4,4,4,3,3,4,2,2,4,3,3,3,4,3,1,2,2,3,1,2,4,1,1,4,2,2,4,1,3,3,4,4,4,3(...TRUNCATED)	{"language":[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,3,2,2,2,2,2,3,4,2,2,2,2,2,4(...TRUNCATED)	0	A1	0	0	[ "combinatorics", "dp", "math" ]	false		{ "nanos": 0, "seconds": 1 }	0
963_B. Destruction of a Tree	"There are some coins in the xy-plane. The positions of the coins are represented by a grid of chara(...TRUNCATED)	{ "input": [ "3\n12 2\n200\n50\n300\n100" ], "output": [ "37" ] }	{ "input": [], "output": [] }	{"input":["2 2\n2 1 2 16\n2 1 2 7\n","1 2\n1 1 1 10\n2 1 1 5\n","6 5\n1 2 3 1\n2 1 2 8\n2 3 4 7\n1 1(...TRUNCATED)	2	11	{"language":[3,2,4,3,2,4,2,3,4,3,3,4,2,2,3,3,2,2,3,2,3,2,3,4,2,2,2,2,2,2,3,3,2,2,2,2,2,3,2,3,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	354		2,000	2,900	[ "" ]	false		{ "nanos": 0, "seconds": 6 }	256,000,000
p03254 AtCoder Grand Contest 027 - Candy Distribution Again	"There is a 120 minute videotape with standard recording. When I set the VCR counter to 00:00:00 wit(...TRUNCATED)	{ "input": [ "5\n0 0\n2 0\n1 1\n2 2\n0 2", "4\n0 0\n3 1\n2 3\n0 3" ], "output": [ "0", "1" ] }	{"input":["z\na\n","abc\naaac\n","bcbcdddbbd\nbcbcdbdbbd\n","aaabccadac\nacabbbabaa\n","a\nb\n","aca(...TRUNCATED)	{"input":["11\n1 2 3 4 5 6 7 8 9 10 11\n2\n1 4 7","11\n1 2 3 4 5 6 2 8 9 10 11\n2\n1 4 1","11\n1 2 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],"solution":["for _ i(...TRUNCATED)	{ "language": [], "solution": [] }	283	C	2,000	2,000	[]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
1374_B. Multiply by 2, divide by 6	"The year of 2012 is coming...\n\nAccording to an ancient choradrican legend in this very year, in 2(...TRUNCATED)	{ "input": [ "3\n4251\n52310\n00006\n\nSAMPLE" ], "output": [ "12\n56\nunlucky" ] }	{"input":["3\n1000000000 1000000000 10000000\n","3\n1 2 1\n","3\n4 10 11\n","5\n1000000000 5 5 4 4\n(...TRUNCATED)	{ "input": [], "output": [] }	2	9	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2],"solution":["#include <bits/stdc++.h>\nusing n(...TRUNCATED)	{"language":[4,2,2,4,4,1,2,3,3,1,1,2,2,3,4,2,3,3,3,2,2,1,2,3,4,4,4,2,2,4,1,2,4,3,1,1,3,3,4,1,1,2,3,3(...TRUNCATED)	507		0	0	[ "brute force", "dp", "strings", "two pointers" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1216_D. Swords	"BubbleSquare social network is celebrating 13^{th} anniversary and it is rewarding its members with(...TRUNCATED)	{"input":["3 2 998244353\n","9 3 998244353\n","3 1 998244353\n","9 4 998244353\n"],"output":["665496(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["ecneyek","ashkfyha","eeyofscienck","mnyszsbzpf","ecneyel","arhkfyha","eeyofsciencj","mnys(...TRUNCATED)	3	21	{"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": [] }	0		0	800	[ "*special" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000