Datasets:

TheFactoryX
/

edition_1099_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
1027_E. Inverse Coloring	"As technologies develop, manufacturers are making the process of unlocking a phone as user-friendly(...TRUNCATED)	{"input":["6 2\n2 3 0 5 6 0\n","6 2\n0 0 1 0 4 5\n","6 1\n2 0 4 0 6 0\n","4 1\n0 0 0 0\n"],"output":(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 3 2 1\n2 4 2 3\n","4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 (...TRUNCATED)	2	9	{"language":[1,3,3,3,2,4,4,3,4,3,2,4,2,3,3,4,3,2,4,1,3,3,4,4,4,4,3,2,2,1,3,1,3,1,4,1,3,3,2,3,4,3,4,1(...TRUNCATED)	{"language":[4,1,2,2,2,1,2,2,2,4,2,3,2,4,4,2,4,2,4,2,2,4,4,2,4,3,2,2,2,2,4,2,4,2,1,2,2,4,2,2,2,2,2,2(...TRUNCATED)	0	B	0	900	[ "brute force", "constructive algorithms", "implementation", "strings" ]	false		null	134,217,728
925_E. May Holidays	"Today, Osama gave Fadi an integer X, and Fadi was wondering about the minimum possible value of max(...TRUNCATED)	{"input":["2 3\n1 2\n1 2\n1 2\n","5 7\n2 4\n5 1\n2 3\n3 4\n4 1\n5 3\n3 5\n"],"output":["5 6 ","10 9 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n1 4\n-1 1\n2 -1","10\n3 2\n3 2\n-1 1\n2 -1\n-3 -6\n-8 12\n7 7\n8 1\n8 2\n8 4","3\n2 4\(...TRUNCATED)	3	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include<bits/stdc++.h>\nusing namespace std;(...TRUNCATED)	{"language":[2,2,2,0,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,0,0,0,2,0,2,2,2,2,0,2,2,0,2,2,0,2,2,2,2,0,2,0,2,2(...TRUNCATED)	0		750	0	[ "binary search", "brute force", "dp", "greedy", "sortings" ]	false		null	1,073,741,824
bogosort	"\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-piz(...TRUNCATED)	{ "input": [ "2\n2 1\n5 4\n3 2\n1 0 2\n\nSAMPLE" ], "output": [ "9\n1\n" ] }	{"input":["100 10000\n337491026 878382762 942177429 998998997 292784016 407647544 813626083 20338593(...TRUNCATED)	{"input":["51 89 97\n18 25 63\n41 91 74\n","1 100 1\n100 100 000\n1 100 100\n","2 10 29\n1 1 43\n1 1(...TRUNCATED)	2	10	{"language":[4,3,3,3,3,3,3,3,3,2,3,3,4,3,3,3,4,4,3,3,4,3,3,3,3,3,3,3,4,2,3,1,3,3,3,3,3,3,3,3,3,3,4,3(...TRUNCATED)	{"language":[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,4,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2(...TRUNCATED)	0	E	500	800	[ "binary search", "combinatorics", "data structures", "dp", "graphs", "implementation", "two pointers" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
309_B. Context Advertising	"Tavak and Seyyed are good friends. Seyyed is very funny and he told Tavak to solve the following pr(...TRUNCATED)	{ "input": [ "3 2 0 2\n0 1 3\n2 5\n" ], "output": [ "1\n" ] }	{"input":["6 4 3\n0 1 2\n1 3 0\n0 4 5\n1 4 4\n1 2 2\n0 4 2\n","50 69 6\n62 91 5\n35 35 53\n85 26 1\n(...TRUNCATED)	{"input":["12\n1\n2\n3\n6\n5\n6\n7\n8\n9\n10\n39\n691\n","12\n1\n2\n3\n6\n5\n6\n7\n8\n9\n6\n39\n691\(...TRUNCATED)	5	7	{"language":[2,2,2,2,2,2,2,2,2,3,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3(...TRUNCATED)	{"language":[2,4,2,1,2,2,4,2,1,2,2,2,2,4,2,2,2,2,2,2,0,4,0,2,0,0,4,0,0,4,2,2,2,4,2,0,0,4,4,2,2,2,0,2(...TRUNCATED)	0		0	0	[ "math", "number theory" ]	false		null	256,000,000
820_A. Mister B and Book Reading	"There are N people standing on the x-axis. Let the coordinate of Person i be x_i. For every i, x_i (...TRUNCATED)	{"input":["10\n","3\n"],"output":["1 2 3 4 5 6 7 8 9 \n2 4 6 8 10 12 14 16 18 \n3 6 9 1(...TRUNCATED)	{"input":["2 2 1\n0 1 1 1\n","5 5 20\n3 1 3 3\n1 2 2 2\n4 3 4 2\n3 2 2 2\n3 4 2 4\n4 1 4 5\n4 3 5 3\(...TRUNCATED)	{"input":["53812 5 967428361\n","12 2 400166453\n","27203 10 802338989\n","59715 12 196344479\n","14(...TRUNCATED)	2	9	{"language":[2,4,2,4,2,2],"solution":["#include <cstdio>\n#include <iostream>\n#include <sstream>\n#(...TRUNCATED)	{"language":[4,4,3,3,1,1,1,3,2,4,2,3,2,4,1,3,1,4,4,2,4,4,2,1,3,2,2,4,1,2,4,2,3,4,4,3,3,4,3,3,4,2,3,4(...TRUNCATED)	0		0	0	[ "*special", "binary search" ]	false		{ "nanos": 0, "seconds": 1 }	536,870,912
306_C. White, Black and White Again	"Yash is finally tired of computing the length of the longest Fibonacci-ish sequence. He now plays a(...TRUNCATED)	{ "input": [ "1000 352 146\n", "10 1 14\n", "20 10 50\n" ], "output": [ "1108\n", "1\n", "0\n" ] }	{ "input": [], "output": [] }	{"input":["1 2 101 42 99 -1","1 2 101 42 33 -1","1 2 101 36 33 -1","1 2 101 36 50 -1","0 2 101 36 50(...TRUNCATED)	2	10	{"language":[4,2,2,2,2,2,4,4,2,2,4,4,2,4,2,2,2,2,2,2,2,4,4,2,4,2,4,4,2,2,2,4,4,2,2,2,4,2,4,2,2,2,2,4(...TRUNCATED)	{ "language": [], "solution": [] }	0		500	1,100	[ "dp" ]	false		{ "nanos": 0, "seconds": 1 }	512,000,000
p01691 Disappear Drive	"You're given a simple, undirected, connected, weighted graph with n nodes and m edges.\n\nNodes are(...TRUNCATED)	{"input":["9\ndo\nthe\nbest\nand\nenjoy\ntoday\nat\nacm\nicpc\n14\noh\nyes\nby\nfar\nit\nis\nwow\nso(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3 1\n2 100 1","12 5\n43 94 27 3 69 99 56 25 15 15 46 8","3 1000\n1 101 1","6 24\n25 171 7(...TRUNCATED)	5	9	{"language":[2,3,4,3,4,3,4,3,3,3,3,2,3,3,4,4,4,3,4,3,2,3,3,4,1,2,3,4,3,2,1,3,4,3,3,4,4,3,1,1,3,3,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,4,1,2,2,2,2(...TRUNCATED)	0		0	2,200	[ "dfs and similar", "dp", "games", "graphs" ]	false	"会津特産の貴金属であるアイヅニウムをリサイクルするＰＣＫ社は、全国(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	134,217,728
p03294 AtCoder Beginner Contest 103 - Modulo Summation	"The court wizard Zigzag wants to become a famous mathematician. For that, he needs his own theorem,(...TRUNCATED)	{"input":["3\nTroll likes Dracul\nDracul likes Anka\nSnowy likes Hexadecimal\n210 200 180\n","2\nAnk(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\n2\n2 1\n1\n6","2\n2\n2 2\n1\n8","2\n2\n4 2\n1\n6","2\n1\n2 1\n1\n1","2\n3\n3 2\n1\n8",(...TRUNCATED)	6	10	{"language":[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,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,4,2,4,2,4,2,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2(...TRUNCATED)	1,170	A	0	900	[]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
614_C. Peter and Snow Blower	"A string is called a k-string if it can be represented as k concatenated copies of some string. For(...TRUNCATED)	{"input":["4\n3\n4 5\n5 9\n7 7\n5\n11 19\n4 17\n16 16\n3 12\n14 17\n1\n1 10\n1\n1 1\n"],"output":["2(...TRUNCATED)	{"input":["6\n0 41 48 86 94 14\n41 0 1 30 59 39\n48 1 0 9 31 49\n86 30 9 0 48 30\n94 59 31 48 0 33\n(...TRUNCATED)	{"input":["3 2\n1 2 5\n","3 10\n5 3 10\n","3 4\n0 2 5\n","1 100\n5\n","7 20\n2 15 12 11 20 19 12\n",(...TRUNCATED)	2	9	{"language":[1,1],"solution":["#!/usr/bin/env python\n#-- coding:utf-8 --\n\n\ndef convert_pair(a,(...TRUNCATED)	{"language":[2,2,2,2,2,3,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	89	C	0	1,600	[ "bitmasks", "dp", "shortest paths" ]	false		{ "nanos": 0, "seconds": 5 }	256,000,000
1301_B. Motarack's Birthday	"Please note the non-standard memory limit.\n\nThere are n problems numbered with integers from 1 to(...TRUNCATED)	{ "input": [ "8\n1 2 3 4 5 6 7 8\n", "4\n1 0 1 2\n" ], "output": [ "1\n3\n6\n10\n16\n24\n40\n", "1\n1\n3\n" ] }	{"input":["2016 4549\n433\n","5000 1\n3\n","4035 369\n26\n","1595 2881\n710\n","3762 3914\n1073\n","(...TRUNCATED)	{"input":["3 1 2\n1\n1 1\n","3 0 3\n\n334 500 0001\n","3 0 3\n\n333 187 1001\n","6 2 3\n2 3\n1 1 1\n(...TRUNCATED)	2	11	{"language":[4,4,4,4,2,3,2,2,2,4,1,2,2,2,4,2,2,3,2,2,3,2,2,2,2,2,2,3,1,2,4,2,4,2,2,3,2,2,2,2,2,2,4,2(...TRUNCATED)	{"language":[0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2],"solution":[(...TRUNCATED)	720		0	1,400	[ "math", "probabilities" ]	false		{ "nanos": 0, "seconds": 1 }	134,217,728