Datasets:

TheFactoryX
/

edition_2108_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
1081_D. Maximum Distance	"Polycarp plays a well-known computer game (we won't mention its name). Every object in this game co(...TRUNCATED)	{"input":["5 3\n00011\n3\n1 2 3\n1\n4\n3\n3 4 5\n","8 6\n00110011\n3\n1 3 8\n5\n1 2 5 6 7\n2\n6 8\n2(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4\nSSSSEEEECCCCEECCCC\nCCCCCSSSSEEECCCCSS\nSCCCCCCCSSEEESSSSS\nEESSSSCCCCCCSSEEEESAMPLE",(...TRUNCATED)	2	16	{"language":[1,2,2,2,2,4,4,4,3,2,4,2,4,2,4,2,3,2,2,2,3,4,2,1,3,2,3,4,3,2,1,4,3,2,2,2,1,2,4,2,4,4,2,2(...TRUNCATED)	{"language":[3,3,2,4,4,4,4,3,3,3,3,3,2,2,4,1,3,4,2,3,2,3,3,3,4,4,4,2,3,4,3,4,4,3,3,3,2,4,3,3,4,2,3,4(...TRUNCATED)	518		0	0	[ "dfs and similar", "dsu", "graphs" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1291_B. Array Sharpening	"In the previous problem Chandu bought some unsorted arrays and sorted them (in non-increasing order(...TRUNCATED)	{ "input": [ "2 3\n", "1 1\n", "49 1808\n" ], "output": [ "6\n", "0\n", "359087121\n" ] }	{ "input": [], "output": [] }	{"input":["1\n2\n905303520 999999998\n999999999 1000000000\n","1\n10\n132182352 630066892\n323711215(...TRUNCATED)	2	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,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,0,2,0,3,2,0,2,2,2,2,2,0,3,2,2,2,3,2,2,4,2,2,2,2,2,2,2,0,3,4,2,2,2,2,2,2,2,2,0,2,0,0,2(...TRUNCATED)	0	C	1,000	0	[ "dp", "implementation" ]	false		null	64,000,000
656_E. Out of Controls	"Monk's birthday is coming this weekend! He wants to plan a Birthday party and is preparing an invit(...TRUNCATED)	{ "input": [ "10\n2 3 1 5 6 4 2 10 7 7\n5\n10 1\n5 7\n10 6\n1 1\n10 8\n" ], "output": [ "3\n0\n1\n1\n0\n" ] }	{"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":["xkbvkadjec gqjlhxpnsx 10\n2 7 1 0 0\n2 5 8 0 0\n4 7 8 0 4\n0 4 7 3 6\n5 5 9 3 7\n7 9 5 0 (...TRUNCATED)	2	0	{"language":[3,3,3,3,4,4,2,3,3,3,4,3,3,2,1,3,3,3,2,1,3,4,4,4,2,3,4,4,3,4,3,4,2,3,3,3,4,1,2,2,3,3,3,1(...TRUNCATED)	{"language":[4,4,3,4,3,1,3,3,4,4,2,4,3,4,3,3,4,3,4,3,4,4,2,3,4,4,3,2,2,4,3,3,2,4,3,3,2,3,2,4,4,3,4,4(...TRUNCATED)	0	B	2,000	1,000	[ "constructive algorithms", "greedy", "number theory" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1088_D. Ehab and another another xor problem	"Gildong was hiking a mountain, walking by millions of trees. Inspired by them, he suddenly came up (...TRUNCATED)	{ "input": [ "5 2\n3 -5 3 -5 3\n", "3 2\n1 2 4\n", "6 3\n4 3 4 3 2 5\n" ], "output": [ "0\n", "1\n", "3\n" ] }	{ "input": [], "output": [] }	{"input":["3 70\n20 30 5","3 10\n20 18 10","2 10\n29 20","4 1111\n1 5 100 1000","4 1111\n-1 2 110 10(...TRUNCATED)	2	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,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,4,2,4,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,4,4,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	1,100	D	500	3,000	[ "binary search", "dp", "sortings", "two pointers" ]	true	"うさぎがある電車のチケットをn 枚持っている. チケットにはそれぞれ0 か(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	0
604_A. Uncowed Forces	"There are n persons who initially don't know each other. On each morning, two of them, who were not(...TRUNCATED)	{ "input": [ "5\n0 1 2 1 2\n", "4\n0 1 2 3\n" ], "output": [ "YES\n1\n2\n3\n5\n4\n", "NO\n" ] }	{"input":["brtakoktrosttttttttttosafasfkalsfkodfdasiofhadfhasdsajfdsafoasodsafahaihfdisoadspapsapios(...TRUNCATED)	{"input":["3\n1\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1","3\n2\n0 1\n0 -1\n1 0\n2\n0 1\n(...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":[2,2,2,2,2,3,2,2,3,2,2,2,2,4,3,3,2,4,2,2,2,2,4,2,3,4,2,2,2,2,2,2,4,2,2,2,2,2,3,2,2,2,2,2(...TRUNCATED)	720	G	2,750	0	[ "binary search", "data structures" ]	false		{ "nanos": 0, "seconds": 1 }	64,000,000
p03407 AtCoder Beginner Contest 091 - Two Coins	"Vasya wants to turn on Christmas lights consisting of m bulbs. Initially, all bulbs are turned off.(...TRUNCATED)	{"input":["(((#)((#)\n","#\n","()((#((#(#()\n","(#)\n"],"output":["1\n2\n","-1\n","1\n1\n3\n","-1\n"(...TRUNCATED)	{"input":["11 20\n1 2\n2 7 6\n1 7\n4 10 9 3 2\n2 9 2\n1 3\n0\n0\n3 1 6 7\n4 11 7 5 6\n2 2 8\n4\n","5(...TRUNCATED)	{"input":["202763616\n","1778707511\n","181182141\n","1438\n","55068349\n","324423196\n","339071627\(...TRUNCATED)	2	0	{"language":[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,1,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	{"language":[4,3,3,4,4,2,2,4,3,1,2,4,2,3,4,2,3,1,4,3,2,2,3,4,3,2,3,2,3,2,4,4,3,2,2,2,2,2,2,4,2,4,2,3(...TRUNCATED)	920		0	0	[ "*special", "data structures", "dsu", "implementation", "math", "sortings" ]	false		{ "nanos": 500000000, "seconds": 0 }	0
bobs-journey-5	"Polycarp plays a computer game. In this game, the players summon armies of magical minions, which t(...TRUNCATED)	{ "input": [ "1\n3\n1 3 2\n\nSAMPLE" ], "output": [ "1 2 3" ] }	{ "input": [], "output": [] }	{"input":["bbcbccbabcbabcbaaccccaaabcbcaacacbabbbbcabcbbbbacbcaccccbcccbccaaabcabacccbaccccbbababccb(...TRUNCATED)	5	7	{"language":[4,4,2,1,2,2,2,2,4,2,2,4,2,4,2,2,2,4,4,4,4,4,3,2,4,2,2,4,4,2,2,2,2,2,2,4,2,2,4,2,2,4,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	571	D1	0	2,800	[ "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
820_A. Mister B and Book Reading	"You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is paint(...TRUNCATED)	{ "input": [ "5 3\n5 5 7 3 1\n", "4 2\n1 2 3 4\n", "2 3\n1 2\n" ], "output": [ "15\n", "8\n", "0\n" ] }	{"input":["0 -2 0\n","1223 -23532 1232\n","0 1 0\n","-1 10 20\n","0 3431 43123\n","-50000 100000 -50(...TRUNCATED)	{"input":["2","6","7","8","10","1","5","9","001","010","5","6","1","9","7","2","10","8","001","010"](...TRUNCATED)	2	8	{"language":[2,2,2,2,2,2,4,4,4,2,4,2,1,4,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,4,2,1,4,3,4,4,2,4,2,4,2,2,2,3,4,3,3,2,4,2,4,2,3,4,3,2,3,4,4,4,2,1,4,3,3,1,3,4,3,3,4(...TRUNCATED)	593	B	1,750	1,600	[ "constructive algorithms", "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 3 }	536,870,912
p02574 AtCoder Beginner Contest 177 - Coprime	"You might have heard about our new goodie distribution program aka the \"Laddu Accrual System\". Th(...TRUNCATED)	{ "input": [ "3\n2 1 2 3\n1 1 1 1\n2 1 0 1\n\nSAMPLE" ], "output": [ "9\n4\n4" ] }	{"input":["9 13\n6 14 19 5 -5 6 -10 20 8\n","8 9\n6 -1 5 -5 -8 -7 -8 -7\n","10 7\n-9 3 -4 -22 4 -17 (...TRUNCATED)	{"input":["4\ncba\ncab\nb\na\n3\nbca\nab\na\n5\nabc\nacb\nb\nc\nc\n5\nabc\nacc\nc\nb\nb\n0","4\ncba\(...TRUNCATED)	2	10	{"language":[2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,4,4,4,4,2,2,2,2,2,2,1,2,1,2,4,2,4,1,2,2,4,2,4,4,2,2,4,3,2,4,4,2,4,4,4,2,2,2,2,2,2,1(...TRUNCATED)	0	A	1,250	900	[ "" ]	false		null	256,000,000
5_A. Chat Server's Outgoing Traffic	"Sherlock Holmes loves mind palaces! We all know that.\n\nA mind palace, according to Mr. Holmes is (...TRUNCATED)	{"input":["11 7 5\n24979445 861648772 623690081 433933447 476190629 262703497 211047202 971407775 62(...TRUNCATED)	{"input":["10\ntypedef errtype ucywcaykzh\ntypeof &ucywcaykzh*****\ntypedef &&&&&&void******(...TRUNCATED)	{"input":["20 20\n1 9\n11 9\n3 5\n15 13\n1 20\n11 18\n10 6\n10 8\n10 19\n12 16\n10 3\n9 18\n8 7\n15 (...TRUNCATED)	5	11	{"language":[2,4,2,4,2,2],"solution":["#include <cstdio>\n#include <iostream>\n#include <sstream>\n#(...TRUNCATED)	{"language":[4,4,4,3,2,4,4,2,2,4,2,4,2,4,4,3,4,2,2,4,2,2,4,1,2,4,2,4,4,2,2,2,2,2,3,4,3,4,2,3,2,3,3,4(...TRUNCATED)	536		0	900	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000