Datasets:

TheFactoryX
/

edition_2832_deepmind-code_contests-readymade

name large_stringlengths 4 70	description large_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 large_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 large_stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
507_B. Amr and Pins	Short Phrase A Short Phrase (aka. Tanku) is a fixed verse, inspired by Japanese poetry Tanka and Haiku. It is a sequence of words, each consisting of lowercase letters 'a' to 'z', and must satisfy the following condition: > (The Condition for a Short Phrase) > The sequence of words can be divided into five sections ...	{ "input": [ "3 2\n1 3\n1 1\n0\n2\n", "2 2\n1 2\n1 1\n1\n", "5 6\n2 2 3\n2 4 5\n1 4\n1 5\n0\n1\n" ], "output": [ "Lose\n", "Draw\n", "Win\n1 2 4 5\n" ] }	{ "input": [], "output": [] }	{ "input": [ "2\n2 2\nyz\n1 1\n2 2\nzy\n1 1\n", "1\n11 2\nthisisatest\n3 7\n", "3\n4 2\nabca\n1 3\n10 5\ncodeforces\n2 8 3 2 9\n26 10\nqwertyuioplkjhgfdsazxcvbnm\n20 10 1 2 3 5 10 5 9 7\n", "2\n2 2\nyz\n1 1\n2 2\nzz\n1 1\n", "3\n4 2\nabca\n1 3\n10 5\ncodeforces\n2 8 3 2 9\n26 10\nqwertyuioplkjhgfm...	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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...	{ "language": [], "solution": [] }	519	F	1,500	2,000	[ "binary search", "dp" ]	false		{ "nanos": 0, "seconds": 2 }	536,870,912
roys-life-cycle	"The black king is standing on a chess field consisting of 109 rows and 109 columns. We will conside(...TRUNCATED)	{ "input": [ "3,4,5\n5,5,8\n4,4,4\n5,4,3" ], "output": [ "1\n2" ] }	{ "input": [], "output": [] }	{"input":["280 2\n","0 2\n","99900 2\n","79086 1\n","1 5\n","100000 96\n","2523 22\n","100000 2\n","(...TRUNCATED)	5	9	{ "language": [], "solution": [] }	{"language":[1,3,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,4,4,2,4,3,1,2,1,2,1,2,4,4,2,2,2,4,4,2,4,4(...TRUNCATED)	500	C	1,250	0	[ "brute force", "implementation", "strings" ]	false	"D：素因数分解の多様性 (The Diversity of Prime Factorization)\n\nProblem\n\nEbi-chan has (...TRUNCATED)	{ "nanos": 0, "seconds": 8 }	256,000,000
the-strongest-string-1-1	"Snuke has decided to play a game, where the player runs a railway company. There are M+1 stations o(...TRUNCATED)	{ "input": [ "2 -3 4\nL 2 5\n? 3 5" ], "output": [ "2\nL 4\nL 3" ] }	{ "input": [], "output": [] }	{"input":["5\n2 1\n5 2\n10 3\n25 4\n25479 33\n","5\n2 1\n9 1\n10 3\n25 4\n25479 33\n","5\n1 1\n9 1\n(...TRUNCATED)	2	11	{"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,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	{"language":[2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2(...TRUNCATED)	0		0	2,800	[ "binary search", "brute force", "dp", "two pointers" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1037_B. Reach Median	"Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba(...TRUNCATED)	{ "input": [ "2\n1 2\n1 2\n" ], "output": [ "\n12\n" ] }	{"input":["100 1 7\n83\n174\n191\n145\n167\n55\n232\n157\n51\n209\n85\n73\n216\n39\n72\n76\n132\n70\(...TRUNCATED)	{"input":["+--+-+\n","+--+--+------+++++++-+-+++--++---+--+-+---+--+++-+++-------+++++-+-++++--+-+-+(...TRUNCATED)	2	7	{"language":[2,3,4,3,3,4,1,3,3,2,4,4,3,3,1,3,2,3,3,2,3,4,3,3,3,2,3,4,4,3,3,3,2,3,3,3,2,3,2,3,3,3,3,3(...TRUNCATED)	{ "language": [], "solution": [] }	1,027		500	3,500	[ "binary search", "dsu", "graphs", "shortest paths", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
1081_G. Mergesort Strikes Back	"You are practicing a juggle that involves in a number of square tiles. They all look the same in th(...TRUNCATED)	{"input":["8\n3 1 4 1 5 9 2 6\n","5\n1 1 1 1 1\n","13\n2 7 1 8 2 8 1 8 2 8 4 5 9\n"],"output":["\n2\(...TRUNCATED)	{"input":["2 3\n1 1 1\n0 1 0","2 2\n1 0\n0 1","3 3\n0 1 0\n1 0 1\n0 1 0","2 2\n0 0\n1 0","2 2\n0 1\n(...TRUNCATED)	{"input":["0?0?","00??","??00????0??1????0?0??00??1???11?1?1???1?11?111???1","1???11??11?1???1?1?11?(...TRUNCATED)	2	11	{"language":[4,4,4,4,3,3,2,2,4,3,4,2,4,4,4,2,3,2,4,3,3,2,4,3,2,1,2,2,4,4,2,3,3,2,3,2,3,3,2,3,3,4,1,4(...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)	70	E	0	2,200	[ "binary search", "data structures", "divide and conquer", "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
893_D. Credit Card	"Phoenix is trying to take a photo of his n friends with labels 1, 2, ..., n who are lined up in a r(...TRUNCATED)	{"input":["2\n5\nTom Jones\nADAMS\nBOB ADAMS\nTom Jones\nSTEVE jONeS\n3\nTrudy\nTrudy\nTRUDY\n\nSAMP(...TRUNCATED)	{"input":["9\n100 100 100 200 100 100 200 100 200\n","3\n100 100 100\n","7\n200 200 200 100 200 200 (...TRUNCATED)	{"input":["20 10 3\nebebccacdb\neeebccddeT\neadebecaac\nadeeeaccbc\nbaccccdaed\nabbaecbaed\ndadbecba(...TRUNCATED)	6	7	{"language":[1,1,1,1],"solution":["M,N=map(int,raw_input().split())\nL=[]\nfor i in range(M):\n L(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,475		1,750	1,700	[]	false		{ "nanos": 500000000, "seconds": 0 }	256,000,000
544_E. Remembering Strings	"The court wizard Zigzag wants to become a famous mathematician. For that, he needs his own theorem,(...TRUNCATED)	{ "input": [ "4\n1 14\n1 50\n4 28\n5 700\n\nSAMPLE" ], "output": [ "1\n10\n3\n32491" ] }	{ "input": [ "5\n90 94\n26 25\n64 84\n14 6\n20 96\n" ], "output": [ "1842\n12\n1015\n3\n1908\n" ] }	{"input":["2\n1 0\n50 50\n50","4\n2 3 4 1\n13 5 1 24\n45 9 15","4\n2 3 4 1\n13 5 1 24\n45 9 16","4\n(...TRUNCATED)	2	9	{ "language": [], "solution": [] }	{"language":[2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	B	0	1,400	[ "dsu", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
405_E. Graph Cutting	"Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integ(...TRUNCATED)	{ "input": [ "5\n2 3 4 6 8" ], "output": [ "1" ] }	{ "input": [], "output": [] }	{"input":["20\n76 86 70 7 16 24 10 62 26 29 40 65 87 49 34 55 92 47 43 100\n","100\n6591 1074 3466 3(...TRUNCATED)	2	9	{"language":[2,1,3,3,3,4,2,3,1,1,2,4,2,3,4,4,3,1,1,3,4,4,3,3,2,3,3,4,2,3,2,2,3,3,4,3,3,3,1,2,3,2,2,3(...TRUNCATED)	{"language":[2,2,2,2,2],"solution":["#include <iostream>\n#include <cstdio>\n#include <vector>\n#inc(...TRUNCATED)	1,199		0	2,100	[ "greedy" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
19_B. Checkout Assistant	"You may know that Euclid was a mathematician. Well, as it turns out, Morpheus knew it too. So when (...TRUNCATED)	{ "input": [ "3\nAFI\n", "6\nAFFAAA\n" ], "output": [ "1", "4" ] }	{ "input": [], "output": [] }	{"input":["5 5 2\ns..#a\n.#...\ne#a.#\n...#a\n.#...","5 5 2\ns..#a\n.#../\n#.a#e\n...#a\n.#...","5 5(...TRUNCATED)	2	7	{"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":[1,2,4,1,4,3,2,2,3,4,2,4,2,1,1,3,4,3,4,4,2,3,1,3,4,3,3,4,4,2,3,2,4,1,4,2,3,3,1,4,2,2,4,2(...TRUNCATED)	378		0	0	[ "combinatorics", "dp", "graphs", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
bogosort	"Given is a string S, where each character is `0`, `1`, or `?`.\n\nConsider making a string S' by re(...TRUNCATED)	{ "input": [ "3\n3 1 0\n1 2 3\nXOR\n3 1 0\n1 2 3\nAND\n3 1 0\n1 2 3\nOR" ], "output": [ "0\n0\n3\n" ] }	{ "input": [], "output": [] }	{"input":["1\n2 3 Chandu\n\nSBMPLE","1\n2 4 Chandu\n\nELPMBT","51\n8 10 Chandu\n2 2959 Daspal\n2903 (...TRUNCATED)	2	10	{"language":[2,2,3,2,2,2,4,4,2,3,2,2,3,3,2,2,1,2,3,2,2,3,3,3,4,3,3,3,4,4,2,3,3,3,4,3,2,2,3,4,4,3,2,2(...TRUNCATED)	{"language":[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,1,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	765		0	0	[]	false		{ "nanos": 0, "seconds": 3 }	512,000,000