Datasets:

TheFactoryX
/

edition_1621_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
609_B. The Best Gift	"You are working for an amusement park as an operator of an obakeyashiki, or a haunted house, in whi(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n500000 500001 500002\n","1\n505050\n","2\n999998 999999\n","2\n500000 500001\n","1\n99(...TRUNCATED)	{"input":["100 10\nigffabeaiaajhjaghjgfjcchheeigjhibadbbhdhcjiibhjjhbhcgidfebhbbjjgbjiafeffihjbeaidg(...TRUNCATED)	2	0	{"language":[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,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,0,2,2,0,2,2,0],"solution":["#include <bits/stdc++.h>\n#define pq priority_queue\nusin(...TRUNCATED)	0	A	500	2,500	[]	false		{ "nanos": 0, "seconds": 3 }	0
1030_E. Vasya and Good Sequences	"Emily's birthday is next week and Jack has decided to buy a present for her. He knows she loves boo(...TRUNCATED)	{"input":["5 5 2\n#####\n#A#B#\n# #\n#b#a#\n#####\n16 4 3\n################\n## ########## ##\n# (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1\n297754\n","16\n2 2 2 3 5 3 5 5 5 7 7 7 11 11 13 17\n","16\n2 2 2 2 2 3 3 5 5 5 5 7 7 1(...TRUNCATED)	2	8	{"language":[4,2,4,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,1,4,4,2,2,4,3,4,4,4,3,2,2,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,0,2,2,2,0,3,2,2,3,2,4,0,2,2,2,2,0,2,2,2,2,4,2,2,2,2,2,0,2,2,2,2,2,2,3,2,2(...TRUNCATED)	0		2,000	2,500	[ "brute force" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p02298 Is-Convex	"Maga and Alex are good at string manipulation problems. Just now they have faced a problem related (...TRUNCATED)	{ "input": [ "3\n0 0 0\n", "5\n0 1 1 1 10\n", "2\n0 1\n" ], "output": [ "3 2 1 ", "1 4 3 2 5 ", "1 2 " ] }	{ "input": [ "1 1\n5\n2 1 6\n" ], "output": [ "1\n" ] }	{"input":["3\n7\n4 6 11 11 15 18 34\n4\n10 10 10 11\n3\n1 1 1000000000\n","1\n3\n39 78868 80000\n","(...TRUNCATED)	6	9	{"language":[1,1,1],"solution":["for _ in range(input()):\n try:\n eval(raw_input())\n (...TRUNCATED)	{"language":[2,4,2,2,2,2,2,2,4,2,2,4,4,2,2,4,2,4,2,4,2,2,2,2,4,4,4,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,4,2(...TRUNCATED)	0	E	0	2,000	[ "brute force", "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	1,073,741,824
455_C. Civilization	"Hexadecimal likes drawing. She has drawn many graphs already, both directed and not. Recently she h(...TRUNCATED)	{"input":["6\n1 1 1 0 0 0\n","5\n0 0 0 0 0\n","7\n1 0 0 1 0 0 1\n"],"output":["\n9\n","\n0\n","\n3\n(...TRUNCATED)	{"input":["1 999999999 29983 29989\n","9999999 10000 29983 29989\n","808351 17767 433 509\n","197 2 (...TRUNCATED)	{"input":["10 2 6\n1 2\n1 4\n2 1 8\n2 9 2\n1 2\n1 9\n2 3 5\n1 8\n","10 5 2\n1 2\n1 3\n2 4\n2 5\n1 6\(...TRUNCATED)	2	0	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["n = int(raw_input())\nm = map(int, (...TRUNCATED)	{"language":[2,2,3,0,3,2,0,3,0,2,2,3,2,3,2,2,0,2,0,3,0,3,3,2,3,2,2,0,2,2,3,3,2,2,2,3,3,3,2,2,4,3,4,2(...TRUNCATED)	893		500	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
188_D. Asterisks	"Vasya has a very beautiful country garden that can be represented as an n × m rectangular field di(...TRUNCATED)	{ "input": [ "3 6\n2 3 5\n", "6 7\n1 2 3 4 5 6\n" ], "output": [ "2\n", "7\n" ] }	{ "input": [], "output": [] }	{"input":["3\n77 42 77\n77 77\n77\n","3\n77 31 77\n77 77\n77\n","4\n1 5 7 12\n1 5 7\n1 5\n","3\n77 7(...TRUNCATED)	2	11	{"language":[2,2,2,2,2,2,2,2,3,3,4,2,2,2,4,4,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,2,2,4,1,3,4,4,2,2,4(...TRUNCATED)	{"language":[2,2,0,2,2,3,2,2,2,2,3,2,2,2,2,2,3,2,2,2,3,2,2,3,2,0,2,3,2,3,2,2,3,2,3,0,0,2,2,2,2,3,2,4(...TRUNCATED)	0	E	0	2,600	[ "bitmasks", "combinatorics", "dp" ]	false		{ "nanos": 0, "seconds": 4 }	134,217,728
702_E. Analysis of Pathes in Functional Graph	"Valeric and Valerko missed the last Euro football game, so they decided to watch the game's key mom(...TRUNCATED)	{ "input": [ "aaba\nabaa\n", "aabb\nabab\n" ], "output": [ "YES\n", "NO\n" ] }	{"input":["2\naaab\n","2\nbabac\n","2\naaaaaabbbb\n","1\naabaab\n","2\naabbbbccccccdddddddd\n","2\na(...TRUNCATED)	{"input":["3\n12 2\n200\n50\n300\n110","3\n17 2\n200\n73\n300\n110","3\n12 2\n200\n50\n599\n100","3\(...TRUNCATED)	2	10	{"language":[1,1,1,1,1],"solution":["import math\nfor _ in xrange(int(raw_input())):\n\tn = int(raw_(...TRUNCATED)	{"language":[2,4,2,2,2,4,2,1,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,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	1,117	G	0	1,800	[ "" ]	false	"あるところに、高い塀に囲まれた大きなお屋敷がありました。そのお屋敷(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
1386_A. Colors	"You're given a simple, undirected, connected, weighted graph with n nodes and m edges.\n\nNodes are(...TRUNCATED)	{"input":["2\n1 2\n","3\n1 2\n2 3\n","5\n1 2\n1 3\n1 4\n2 5\n","6\n1 2\n1 3\n1 4\n2 5\n2 6\n"],"outp(...TRUNCATED)	{"input":["10\n62159435 282618243 791521863 214307200 976959598 590907019 166397456 708291256 853773(...TRUNCATED)	{"input":["9 3\n","56 1000\n","1000 1100\n","5 10\n","1100 500\n","3 1001\n","900 1\n","1 3\n","3 16(...TRUNCATED)	3	0	{"language":[1],"solution":["testcase = raw_input();\ntc = int(testcase)\n\nwhile (tc > 0):\n\t\n\t(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	343		0	1,000	[ "binary search", "geometry", "two pointers" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p02744 Panasonic Programming Contest 2020 - String Equivalence	"You are given a simple arithmetic expression of the form a?b, where a and b are integer constants, (...TRUNCATED)	{"input":["1\n1\n","2\n1 2\n3 4\n","4\n5 7 8 4\n9 5 3 2\n1 6 6 4\n9 5 7 3\n"],"output":["0\n","2\n",(...TRUNCATED)	{"input":["50 5000\n2 35 46\n2 43 92\n2 16 88\n2 67 99\n2 36 93\n2 12 20\n2 33 96\n2 55 82\n2 18 32\(...TRUNCATED)	{"input":["4\n1 1 1 1 1 1 1 1 1 1 1 1 3 3 6 3\n","1\n53\n","1\n77\n","1\n20\n","1\n10\n","1\n11\n","(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,4,2,2,2,2,1,4,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,4,4,4,4,2,3,3,3,3,3,3,3,3,2,3,2,4,3,1,4,2,2,2,3,2,4,4,2,3,3,4,2,2,3,1,3,2,4,4,4,3,2(...TRUNCATED)	1,158	F	0	2,400	[ "" ]	false		null	0
571_E. Geometric Progressions	"Programmer Vasya is studying a new programming language &K. The &K language resembles the languag(...TRUNCATED)	{ "input": [ "1\n9\n10\n1\n\nSAMPLE" ], "output": [ "10" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	0	{ "language": [], "solution": [] }	{"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)	544	B	0	0	[ "dp" ]	false		{ "nanos": 0, "seconds": 4 }	0
p03407 AtCoder Beginner Contest 091 - Two Coins	"problem\n\nIf you write a positive integer in decimal notation (without leading 0) and look at the (...TRUNCATED)	{"input":["3 3 1 10\n@#b\n.#.\n.#.\nb 100","3 3 1 20\n@C\n..\n...\nC 10","3 3 1 10\n@0.\n...\n...\(...TRUNCATED)	{"input":["3 14\n8 9\n10 7\n","12 11\n11 12\n16 7\n","12 17\n10 19\n13 16\n","9 12\n3 17\n10 10\n","(...TRUNCATED)	{"input":["3\n2 3 6","3\n2 3 11","3\n3 2 3","3\n2 5 3","3\n2 2 3","3\n2 2 11","3\n3 2 6","3\n2 2 13"(...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,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,4,2,2,2,2,2,2,2,2,3,0,2,3,2,2,0,2,2,3,0,2,2,2,2,3,3,2,3,4,3,3,2,3,2,0,2,2,2,0,3,4,0,2(...TRUNCATED)	79	A	0	0	[ "math" ]	false	"データを並べ替えるための整列（ソート）アルゴリズムはコンピュータ科(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000