Datasets:

TheFactoryX
/

edition_1678_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
p02705 AtCoder Beginner Contest 163 - Circle Pond	"After playing Neo in the legendary \"Matrix\" trilogy, Keanu Reeves started doubting himself: maybe(...TRUNCATED)	{ "input": [ "777-444---21-12-2013-12-2013-12-2013---444-777\n" ], "output": [ "13-12-2013\n" ] }	{ "input": [], "output": [] }	{"input":["aaaa b","dcba cb","aa`a a","dcac dc","a``a a","b abab","aaaa c","dcba bc","b baba","aaa` (...TRUNCATED)	3	11	{"language":[2,2,4,2,2,3,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,4,2,4,2,2(...TRUNCATED)	0	C	0	0	[ "dp", "probabilities" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
1149_E. Election Promises	"Every day Ruslan tried to count sheep to fall asleep, but this didn't help. Now he has found a more(...TRUNCATED)	{ "input": [ "2\n2\n3\n\n\nSAMPLE" ], "output": [ "2\n4\n" ] }	{ "input": [], "output": [] }	{"input":["4\n11833\n5512\n100\n28436\n33903\n100\n84816\n75747\n100\n92281\n31380\n100","1\n45819\n(...TRUNCATED)	3	12	{"language":[1,1,1,1],"solution":["t=int(raw_input())\ndef z(x):\n i=5\n c=0\n while x/i>=1(...TRUNCATED)	{"language":[2,0,2,3,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,0,2,2,2,2,2,3,2,2,2,2,2,2,2,3,2,2,2,2,2,2(...TRUNCATED)	316	C	0	0	[ "*special", "implementation" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
luckybal	"Disclaimer: there are lots of untranslateable puns in the Russian version of the statement, so ther(...TRUNCATED)	{ "input": [ "2\n1\n3\n\nSAMPLE" ], "output": [ "1\n26\n" ] }	{"input":["#(#(#((##((()))(((#)(#()#(((()()(()#(##(((()(((()))#(((((()(((((((()#((#((()(#(((()(()##((...TRUNCATED)	{"input":["3 10 10\n1\n1 1 1\n1\n3 3 3\n1\n5 5 5\n0 1 1\n1 0 0\n0 1 0","1 10 3\n3\n1 10 1\n2 20 2\n3(...TRUNCATED)	5	0	{"language":[1],"solution":["#Manage maximum events given start date and duration for a case\ndef ma(...TRUNCATED)	{ "language": [], "solution": [] }	0		500	0	[ "bitmasks", "dp" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
1027_E. Inverse Coloring	"You are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = ((...TRUNCATED)	{"input":["2 2 1\n2 3 1\n3 2 3\n2 3 5"],"output":["3.9681187851\n6.7970540913\n6.5668891783\n13.9527(...TRUNCATED)	{"input":["8\nFF\nFF\n00\n00\nFF\nFF\n00\n00\n","4\n0\n0\n0\n1\n","8\n33\n33\n33\n33\n33\n33\n11\n11(...TRUNCATED)	{"input":["4\nRBRR","4\nBBRR","4\nRRCR","4\nRRAR","4\nRARR","4\nBQBR","4\nRCRR","4\nBPBR","4\nRRRC",(...TRUNCATED)	1	11	{"language":[2,2,2,2,2,2,2,2,2,4,2,2,4,2,3,2,2,4,4,2,4,4,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,4,2,2,2,2,3,2,2,2,1,2,2,2,4,2,2,2,4,4,1,2,4,4,2,1,4,4,4,2,2,2,2,4,2,2,2,1,2,4,2,2,2,2(...TRUNCATED)	0	C	0	2,300	[ "dp", "flows", "graph matchings", "greedy" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
45_H. Road Problem	"A recently found Ancient Prophesy is believed to contain the exact Apocalypse date. The prophesy is(...TRUNCATED)	{"input":["2\n2 2\n3 3\n","2\n2 2\n4 1\n"],"output":[" (...TRUNCATED)	{"input":["9 12\n1 2\n2 3\n4 5\n5 6\n6 7\n7 8\n1 4\n4 7\n2 5\n5 8\n3 6\n6 9\n","5 4\n2 1\n3 2\n4 3\n(...TRUNCATED)	{ "input": [], "output": [] }	3	13	{"language":[1,1],"solution":["'''\n# Read input from stdin and provide input before running code\n\(...TRUNCATED)	{"language":[4,2,2,4,4,4,4,2,3,2,4,1,4,4,2,4,4,2,4,3,2,2,3,3,2,2,1,4,2,3,4,3,2,2,1,2,2,2,4,2,2,4,2,2(...TRUNCATED)	1,311		0	2,900	[]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
1239_E. Turtle	"Once upon a time, there was a king who loved beautiful costumes very much. The king had a special c(...TRUNCATED)	{"input":["3\n7\n4 6 11 11 15 18 20\n4\n10 10 10 11\n3\n1 1 1000000000\n"],"output":["1 2 7\n-1\n1 2(...TRUNCATED)	{"input":["1\n2 2\n1 1\n1 2\n","1\n1 3\n3\n1 2 3\n","1\n1 1\n1000\n1000\n","1\n2 2\n2 2\n2 2\n","5\n(...TRUNCATED)	{"input":["1 10\n1 5 9 5\n1\n5 5 L 0\n","3 7\n2 4 2 7\n4 7 4 6\n7 3 5 3\n10\n6 7 L 1\n6 7 L 2\n6 7 L(...TRUNCATED)	2	12	{"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": [] }	378		500	2,000	[ "binary search", "dp", "greedy", "sortings" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1490_G. Old Floppy Drive	"There is little time left before the release of the first national operating system BerlOS. Some of(...TRUNCATED)	{"input":["7 5\n1 2\n2 7\n7 6\n2 3\n3 4\n","2 1\n1 2\n","7 6\n1 2\n2 7\n7 6\n2 3\n3 4\n1 5\n"],"outp(...TRUNCATED)	{"input":["20\n...............\n","97\n*..*.......**......................(...TRUNCATED)	{"input":["58\n","138868\n","562984\n","359885\n","12\n","53728\n","252321\n","714009\n","38\n","439(...TRUNCATED)	6	8	{"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,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...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)	425	A	0	900	[ "brute force" ]	false		{ "nanos": 0, "seconds": 1 }	0
551_B. ZgukistringZ	"Dima and Inna love spending time together. The problem is, Seryozha isn't too enthusiastic to leave(...TRUNCATED)	{ "input": [ "0.0,0.0,1.0,0.0,1.0,1.0,0.0,1.0\n0.0,0.0,3.0,0.0,1.0,1.0,1.0,3.0" ], "output": [ "YES\nNO" ] }	{"input":["81\n9 4\n6 8\n6 4\n4 6\n4 8\n9 10\n0 2\n5 4\n8 9\n7 7\n10 5\n4 4\n7 8\n3 7\n2 1\n5 5\n2 7(...TRUNCATED)	{"input":["6\n5 2 4 6 1 0","6\n5 6 4 4 1 3","6\n6 2 4 6 1 0","6\n5 6 4 4 1 2","6\n6 2 4 6 0 0","6\n5(...TRUNCATED)	2	0	{"language":[1,1],"solution":["t = int(raw_input())\n\nd = {}\n\nfor i in range(t):\n\t\n\ts = raw_i(...TRUNCATED)	{"language":[3,2,2,2,4,2,3,2,4,1,4,3,4,4,4,4,3,3,3,4,4,2,4,3,2,3,3,3,2,2,3,2,2,4,2,4,4,3,2,4,2,1,2,4(...TRUNCATED)	283	C	0	3,000	[]	false		{ "nanos": 0, "seconds": 5 }	256,000,000
1328_F. Make k Equal	"Tree is a connected acyclic graph. Suppose you are given a tree consisting of n vertices. The verte(...TRUNCATED)	{"input":["12\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n39\n691\n"],"output":["\n1\n-1\n2\n3\n-1\n5\n4\n7\n-1\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["8 15\n","6 1\n","8 9\n","500 17172\n","5 2\n","5 9\n","2 7\n","3 15\n","61 249001\n","8 5(...TRUNCATED)	2	7	{"language":[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>\n\(...TRUNCATED)	{ "language": [], "solution": [] }	277		1,500	2,600	[ "constructive algorithms", "greedy", "sortings" ]	false	"\n\n問題\n\nAORイカちゃんはテストに合格するため勉強しています。\n\nAORイ(...TRUNCATED)	null	256,000,000
1374_E1. Reading Books (easy version)	"Sarah is a girl who likes reading books.\n\nOne day, she wondered about the relationship of a famil(...TRUNCATED)	{"input":["4\n10 4\n4 5\n5 2\n2 1\n1 3\n1 9\n9 10\n2 7\n7 8\n5 6\n4 3\n1 2\n2 3\n3 4\n5 3\n1 2\n1 3\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1000 1001\n82 636 713 516\n","1000 1998\n316 681 19 233\n","4 8\n1 3 4 2\n","5 6\n4 3 2 1(...TRUNCATED)	2	10	{"language":[2,2,2,2,2,4,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,2,2,2,2],"solution":["#include <iostream>\n#include <cstdio>\n#include <vector>\n#inc(...TRUNCATED)	76	C	0	1,800	[ "dp" ]	false		null	268,435,456